math-skill 2.1.0 → 3.0.1

package/skills/discrete-combinatorial/SKILL.md

@@ -1,131 +0,0 @@
----
-name: discrete-combinatorial
-description: |
-  触发：当需要计数、枚举、发现有限结构中的规律，或处理图论、组合结构、生成函数、递推关系；或为稀疏/路由/拓扑结构设计组合方案时调用。
-  English: Trigger when you need to count, enumerate, find patterns in finite structures, or handle graph theory, combinatorial structures, generating functions, recurrences; or design combinatorial schemes for sparse/routing/topological structures.
----
-
-> **语言路由**：若用户消息为英文，请读取并遵循同目录下的 `SKILL.en.md`，按其操作规程以英文输出；中文消息则继续使用本文件。
-
-# 🧮 离散与组合思想 / Discrete & Combinatorial
-
-> "计数是最古老的数学活动——有限对象蕴含无限规律。"
-> "Counting is the oldest mathematical activity — finite objects harbor infinite patterns."
->
-> —— 组合数学、图论、生成函数
-> —— Combinatorics, Graph Theory, Generating Functions
-
-## 核心原则 / Core Principle
-
-**组合思想对有限结构进行系统计数、发现支配枚举的规律，并用生成函数等代数方法将计数问题变换为代数问题——有限的简单掌控无限的复杂。**
-
-**Combinatorial thinking systematically counts finite structures, discovers patterns governing enumeration, and uses algebraic methods (generating functions) to recast counting as algebra — finite simplicity governing infinite complexity.**
-
-> **数学形式化 / Mathematical Formalization**
->
-> **鸽巢原理 (Pigeonhole Principle)**：n 个物品放入 m < n 个盒子，则某盒至少含 2 个；推广 kn+1 入 n 盒则某盒至少含 k+1。存在性证明利器——只证必然存在，不构造具体实例。
->
-> **容斥原理 (Inclusion-Exclusion)**：|A₁∪...∪A_n| = Σ|A_i| − Σ|A_i∩A_j| + ... ± |A₁∩...∩A_n|；补集计数："不具有 P" = 全部 − "具有 P"。
->
-> **生成函数 (Generating Functions)**：常生成函数 OGF A(x)=Σa_n x^n（无序/组合，A·C 系数 = Σa_i·c_{n−i}）；指数生成函数 EGF B(x)=Σb_n x^n/n!（有序/有标号，B·D 系数/n! = Σ(b_i/i!)·(d_{n−i}/(n−i)!)）。
->
-> **Pólya 计数定理 (Pólya Enumeration)**：群 G 作用下的轨道计数 = (1/|G|)Σ_{g∈G}|Fix(g)|（Burnside 引理），用循环指标多项式刻画"旋转/翻转视为相同"的等价类着色计数。
->
-> Euler 的洞察：将 1+2+3+... 的"发散级数"重新诠释为分拆计数的生成函数。
-
-## GPU 友好性 / GPU-Friendliness（横切检查）
-
-离散/组合结构常「美但不可算」——精确计数多为 #P 完备（着色计数、匹配计数），精确枚举 NP-hard（Hamilton 路、子集和），直接落 GPU 不可行。落 GPU 须过 `../../references/gpu-friendly-math.md` 八维门，改用可张量化的聚合与采样近似：
-
-- **友好**：邻接矩阵幂迭代 A^k 计路径数（GEMM）、动态规划表批量并行、bitset packed 计数（popcount）、结构化稀疏图遍历。
-- **可改造**：容斥/递推 → 半环聚合（(min,+) / (max,+) / Boolean / 热带半环）张量化；精确计数 → 蒙特卡洛/重要性采样估计；枚举 → 分支定界剪枝 + 批量并行；离散选择 → Gumbel-softmax 松弛。
-- **反模式**：精确全枚举（n! 爆炸）、串行回溯搜索、强串行 DP（长程依赖不可并行）、非结构化图随机访存——"美但不可算"，须近似或松弛。
-
-八维最低判定（正式术语）：**张量化**看有限对象能否编码成矩阵/bitset/批量表；**GEMM 可映射**看递推能否半环矩阵化；**复杂度**明确 NP-hard/#P-hard 与近似界；**显存与 KV-Cache**检查枚举表、DP 表、邻接结构是否爆炸；**低精度稳定**看松弛采样和半环运算是否数值稳健；**并行与通信**看子问题是否独立或可斜扫描；**稀疏结构**只采用块/带状/规则图稀疏；**算子融合**看计数、mask、采样能否合并为少量 kernel。
-
-> 配合 `../../references/books/abstract-algebra.md`（半环/有限域聚合）、`../../references/books/matrix-analysis.md`（邻接矩阵/谱图）。
-
-## 不适用场景 / When NOT to Use
-
-- **连续/分析性问题，无离散结构**——极限、微分、积分而非有限对象计数，属分析而非组合。
-- **精确闭式公式可直接给出答案**——组合枚举是多余开销（如 n·(n−1) 直接代数运算）。
-- **纯粹概率问题，无组合结构**——连续分布参数估计、贝叶斯更新不涉及有限集合计数，概率密度积分不是组合问题。
-
-## 何时使用 / When to Use
-
-- 需要计数配置数量（排列/选择/分配），答案是具体有限数而非 1 或无穷。
-- 需通过鸽巢原理证存在性（"必存在某对象具某性质"）而不构造实例。
-- 需发现枚举数列 {a_n} 的递推或封闭公式（如 Catalan C_n = (2n)!/(n!(n+1)!)）。
-- 需枚举满足约束的配置——按结构分类、按规则生成，非随机罗列。
-- 需图/网络分析（连接、路径、匹配、着色、覆盖）——社交网络、调度、规划可化为图问题。
-- 需求解递推关系求封闭公式或渐近行为——递推 → 生成函数 → 代数求解 → 提取系数。
-- **为稀疏/路由/拓扑结构设计组合方案**——稀疏 attention 模式、路由表/拓扑排序、块结构化稀疏布局。
-
-## 方法流程 / Method
-
-### 第一步：识别离散结构与计数问题
-明确**计数对象**（排列/组合/分拆/安排）、**目标**（总数/带约束子集/概率）、**约束**（互不相交、有序/无序、有标号/无标号）。分类：排列 P(n,k)=n!/(n−k)!；组合 C(n,k)=n!/(k!(n−k)!)；分拆 p(n) 整数分拆、B(n) 集合分拆；安排（物品入位置）。
-
-### 第二步：应用基本计数原理
-- **乘法原理**：k 个独立选择 → k₁×k₂×...×k_n。
-- **加法原理**：互斥选项 → |A∪B|=|A|+|B|（A∩B=∅）。
-- **鸽巢原理**：n>m 碰撞不可避免，某盒至少 ⌈n/m⌉；推广 kn+1 入 n 盒则某盒至少含 k+1。
-
-### 第三步：使用容斥原理
-|A₁∪...∪A_n| = Σ|A_i| − Σ|A_i∩A_j| + Σ|A_i∩A_j∩A_k| − ... ± |A₁∩...∩A_n|。**补集计数**："不具有 P" = 全部 − "具有 P"；经典错排 D(n) = n! − C(n,1)(n−1)! + C(n,2)(n−2)! − ... ± C(n,n)·0!。**符号规则**：第 k 层贡献 = (−1)^{k+1} Σ|A_{i₁}∩...∩A_{i_k}|（奇层正、偶层负）。
-
-### 第四步：构造生成函数
-- **OGF**：A(x)=Σa_n x^n，无序/组合；A(x)·C(x) 系数 = Σa_i·c_{n−i}（组合两个独立计数）。
-- **EGF**：B(x)=Σb_n x^n/n!，有序/排列/有标号；B(x)·D(x) 系数/n! = Σ(b_i/i!)·(d_{n−i}/(n−i)!)。
-- 经典：分拆 P(x)=Σp(n)x^n = 1/((1−x)(1−x²)(1−x³)...)；Catalan C(x)=ΣC_n x^n = (1−√(1−4x))/(2x)，由 C_n=ΣC_i·C_{n−1−i} 得 C(x)=1+x·C(x)²。
-
-### 第五步：分析图结构
-图 G=(V,E)，|V| 顶点、|E| 边。核心：度数 deg(v)、邻接/关联矩阵；路径/连通分量、最短路（Dijkstra、Floyd-Warshall）；树恰 n−1 边、生成树（Kruskal/Prim）、二叉树计数 C_n；平面图 Euler 公式 V−E+F=2、E≤3V−6；色数 χ(G)、四色定理 χ(平面图)≤4；匹配（Hall 婚姻定理、König：二分图最大匹配=最小顶点覆盖）；Euler 环（连通且全度数偶）、Hamilton 环（NP-complete）。
-
-### 第六步：发现递推与封闭公式
-- **递推**：Catalan C_n=ΣC_i·C_{n−1−i}，Fibonacci F_n=F_{n−1}+F_{n−2}，错排 D_n=(n−1)(D_{n−1}+D_{n−2})。
-- **生成函数求解**：递推乘 x^n 求和 → 解 A(x) → 提取 a_n；Fibonacci F(x)=x/(1−x−x²)，部分分式得 F_n=(φ^n−ψ^n)/√5（φ=(1+√5)/2）。
-- **直接公式**：C(n,k)=n!/(k!(n−k)!)（n 选 k 无序）；Catalan C_n=C(2n,n)/(n+1)（合法括号序列组合论证）。
-
-### 第七步：验证与推广
-检查小案例 n=0,1,2,3 手动枚举与公式对比；验证公式计数正确、递推自洽、边界条件无误（空结构计数为 1：C₀=1, F₀=0, F₁=1）；推广至更一般参数或更深组合解释。
-
-> **验证不是可选的——未经验证的计数公式不可信。** n=3 的手动枚举与公式对比是最低验证要求。
-
-## 常见错误 / Common Errors
-
-| 错误 / Error | 批评 / Critique | 正确做法 / Correct Approach |
-|---|---|---|
-| 漏计与重计 | 漏计：遗漏约束交互少计；重计：同配置多次计算 | 明确约束交互，容斥修正重计，补集修正漏计 |
-| 忽略约束条件交互 | 约束非独立，交集须容斥处理 | 用容斥：并集 = 各集之和 − 交集 |
-| 混淆排列与组合 | 排列计序 P(n,k)=n!/(n−k)!，组合不计序 C(n,k)=n!/(k!(n−k)!) | 先判有序/无序再选公式 |
-| 错误使用容斥符号 | 奇层正、偶层负，符号错则结果偏差 | 严格按 (−1)^{k+1} 定符号 |
-| 忽略生成函数收敛域 | 形式幂级数可忽略收敛，但提封闭公式须在收敛域内 | 区分形式操作与解析操作 |
-| 混淆有标号/无标号 | 有标号用 EGF，无标号用 OGF | 排列/分布→EGF；组合/分拆→OGF |
-| 鸽巢原理使用不当 | 仅证存在性不构造实例，需 n>m | 确认 n>m，结论为"至少一个"非"恰好一个" |
-| 递推边界条件错误 | C₀=1 非 0；F₀=0, F₁=1 | 空结构=1，检查 n=0,1 边界 |
-| GPU 不可算性 | 精确枚举/计数 #P 或 NP-hard 爆炸 | 改半环聚合/采样近似，过 GPU 八维门 |
-
-## 操作规程 / Operating Procedure
-
-当本 skill 被触发时，输出必须包含：
-
-1. **结构识别**：`[结构]: [离散对象]` — 计数对象、约束、分类
-2. **计数类型**：`[计数类型]: [排列/组合/分拆/安排]` — 有序/无序、有标号/无标号
-3. **原理选择**：`[原理]: [乘法/加法/鸽巢/容斥]` — 选择理由
-4. **生成函数**：`[生成函数]: [公式]` — GF 及代数性质（如涉及）
-5. **图结构**：`[图结构]: [属性]` — 顶点/边/连通/着色（如涉及）
-6. **递推/公式**：`[递推/公式]: [内容]` — 递推及封闭公式
-7. **验证**：`[验证]: [小案例]` — 至少 n=0,1,2,3 手动枚举与公式对比
-8. **[GPU 可行性]**（若用于算法/算子设计）— 精确计数/枚举是否 NP-hard/#P，能否半环聚合/张量化/采样近似，过八维门
-
-**输出不得只给分析而无结论。**
-
-## 与其他 skill 的关系 / Relations to Other Skills
-
-- **归纳与类比**：组合规律由归纳发现——从 {a_n} 前几项归纳递推，再类比到更一般结构。
-- **算法思想**：组合计数支撑复杂度分析——n!、C(n,k) 是算法代价估计基础。
-- **概率与统计**：组合是概率的计算基础——古典概率 P(A)=|A|/|Ω|，分子分母皆组合计数。
-- **变换思想**：生成函数将计数变换为代数——序列→幂级数，递推→方程，计数→系数提取。
-- **公理化思想**：组合恒等式需严格证明——C(n,k)=C(n,n−k) 须代数或组合论证，不可仅凭直觉。
-- **现代数学激活**：`../../references/books/abstract-algebra.md`（有限域/半环聚合、Burnside 计数）、`../../references/books/matrix-analysis.md`（邻接矩阵/谱图/传递矩阵）。

package/skills/discrete-combinatorial/original-texts.en.md

@@ -1,184 +0,0 @@
-# Discrete & Combinatorial Thinking — Original Texts & Historical Context
-
----
-
-## 1. Pigeonhole Principle — Dirichlet (1834)
-
-Peter Gustav Lejeune Dirichlet stated the pigeonhole principle in 1834 as the "Schubfachprinzip" (drawer principle), using it for existential proofs in number theory.
-
-> "Wenn man n + 1 Objecte in n Facher distribuiert, so ist mindestens ein Fach mit zwei Objecten besetzt."
-> — Dirichlet, 1834
-
-**Core statement:**
-- Basic form: if n items are placed into m boxes and n > m, then some box contains at least ⌈n/m⌉ items
-- Generalized form: kn+1 items into n boxes → some box contains at least k+1 items
-- Number theory application: for any real number α and integer N, there exists q ≤ N such that |qα − p| < 1/(N+1) (i.e., qα approximates an integer)
-
-**Diophantine approximation:** Partition [0,1) into N+1 equal-length intervals ("boxes"), and consider the N+2 numbers {0, {α}, {2α}, ..., {(N+1)α}} ("items"). The pigeonhole principle guarantees that two must fall into the same interval, yielding |(q₁−q₂)α − ⌊(q₁−q₂)α⌋| < 1/(N+1). This is the standard pigeonhole proof of Dirichlet's approximation theorem.
-
----
-
-## 2. Euler's Generating Functions (1748)
-
-Leonhard Euler pioneered the generating function method in **Introductio in analysin infinitorum** (1748) — transforming sequences into power series, and counting into algebraic operations.
-
-> "If we ask how many ways a given number can be partitioned, we are led to a study of the generating function." — Euler, 1748
-
-**Partition generating function:**
-$$P(x) = \sum_{n=0}^{\infty} p(n) x^n = \prod_{k=1}^{\infty} \frac{1}{1-x^k}$$
-- p(n) = the number of partitions of n into positive integers. p(5) = 7: {5, 4+1, 3+2, 3+1+1, 2+2+1, 2+1+1+1, 1+1+1+1+1}
-- Product form: 1/(1−x^k) = 1+x^k+x^{2k}+... represents "taking 0, 1, 2, ... copies of k"; since each k is independent, the product encodes all combinations
-
-**Pentagonal number theorem (Euler 1750):**
-$$\prod_{k=1}^{\infty}(1-x^k) = \sum_{m=-\infty}^{\infty} (-1)^m x^{m(3m-1)/2}$$
-- Generalized pentagonal numbers e_m = m(3m−1)/2: 0, 1, 2, 5, 7, 12, 15, 22, ...
-- From P(x)·∏(1−x^k) = Σ(−1)^m x^{e_m}, one obtains the recurrence p(n) = p(n−1)+p(n−2)−p(n−5)−p(n−7)+...
-- This is a classic example of a finite recurrence controlling an infinite sequence — the essence of combinatorial thinking
-
-**Hardy-Ramanujan asymptotic formula (1918):**
-$$p(n) \sim \frac{1}{4n\sqrt{3}} \exp\left(\pi\sqrt{\frac{2n}{3}}\right)$$
-
----
-
-## 3. Catalan Numbers
-
-**History:** Eugène Catalan (1838) studied the counting problem of nested parentheses, from which the Catalan numbers derive their name. However, Euler had already studied a related problem (polygon triangulation) in 1751.
-
-**Definition and formula:**
-$$C_n = \frac{1}{n+1}\binom{2n}{n} = \frac{(2n)!}{n!(n+1)!}$$
-- Recurrence: C₀ = 1, C_n = ΣC_i·C_{n−1−i}
-- Generating function: C(x) = ΣC_n x^n = (1−√(1−4x))/(2x), obtained by solving C(x) = 1 + x·C(x)²
-
-**Combinatorial interpretations (60+):**
-- **Binary trees**: the number of ordered binary trees with n nodes = C_n
-- **Dyck paths**: lattice paths from (0,0) to (2n,0), with steps (+1,+1) or (+1,−1), never crossing above y=0
-- **Parenthesizations**: the number of valid nestings of n pairs of parentheses = C_n
-- **Ballot problem**: A receives n+1 votes, B receives n votes; the number of sequences in which A is always ahead of B = C_n (Bertrand 1887)
-- **Polygon triangulation**: the number of distinct triangulations of an (n+2)-gon = C_n
-
-First few terms: C₀=1, C₁=1, C₂=2, C₃=5, C₄=14, C₅=42, C₆=132
-
----
-
-## 4. Ramsey Theory — Ramsey (1930)
-
-Frank P. Ramsey proved in **"On a Problem of Formal Logic"** (1930) that sufficiently large systems necessarily contain some structure — a profound generalization of the pigeonhole principle.
-
-> "In any sufficiently large system, complete disorder is impossible." — Cohen
-
-**Ramsey numbers:**
-$$R(s,t) = \min\{n : \text{every 2-coloring of the complete graph on } n \text{ vertices contains a red } K_s \text{ or a blue } K_t\}$$
-
-**Known values:** R(3,3)=6 (at a party of 6 people, there must be 3 mutual acquaintances or 3 mutual strangers; proof: fix one person, among the remaining 5 at least 3 share the same relationship color by the pigeonhole principle; if any 2 of those 3 share that color they form a monochromatic triangle, otherwise those 3 form a triangle of the other color), R(4,4)=18, R(3,4)=9, R(3,5)=14.
-
-**General bounds:** Erdős 1947 probabilistic method: R(k,k) > 2^{k/2}; upper bound R(k,k) ≤ 4^k. R(5,5) is unknown (43 ≤ R(5,5) ≤ 48). Erdős: "If aliens demanded R(5,5), we should marshal all our computers; if they demanded R(6,6), we should prepare for battle."
-
----
-
-## 5. Graph Theory — Euler (1736)
-
-**Seven Bridges of Königsberg (1736):**
-
-Leonhard Euler, in **"Solutio problematis ad geometriam situs pertinentis"** (1736), solved the Königsberg bridge problem, founding graph theory.
-
-> "The problem... is to find whether one can cross each of the seven bridges exactly once and return to the starting point." — Euler, 1736
-
-**Euler circuit theorem:**
-- A connected graph has an Euler circuit (a closed walk traversing every edge exactly once) if and only if all vertices have even degree
-- The Königsberg graph: the 4 vertices have degrees 3, 3, 3, 5 (all odd), so no Euler circuit exists — the problem has no solution
-
-**Euler's planar formula (1750):**
-$$V - E + F = 2$$
-- For any connected planar graph: the number of vertices V, edges E, and faces F satisfy this formula
-- Corollaries: for a simple connected planar graph E ≤ 3V − 6; for a planar graph containing no K₃, E ≤ 2V − 4
-
-**Matching theory:**
-- König (1931): in a bipartite graph, the maximum matching size = the minimum vertex cover size (König's theorem)
-- Hall's marriage theorem (1935): a bipartite graph G(X,Y) has a perfect matching from X to Y if and only if for every S ⊆ X, |N(S)| ≥ |S|
-
----
-
-## 6. Pólya Enumeration Theorem (1937)
-
-George Pólya, in his 1937 paper, provided a counting method under symmetry — the orbit counting theorem, the meeting point of combinatorial enumeration and group theory.
-
-> "The number of distinct colorings is obtained by averaging over the group action." — Pólya, 1937
-
-**Theorem statement:**
-Let group G act on set X. The number of equivalence classes of k-colorings (number of orbits):
-$$N = \frac{1}{|G|} \sum_{g \in G} k^{c(g)}$$
-where c(g) = the number of cycles of the permutation g. Applications: chemical isomers, bead necklace patterns. Burnside's lemma (1897): N = (1/|G|)Σ|Fix(g)| is a special case of Pólya's theorem. Pólya generalized this to a weighted version: GF × cycle index = symmetric counting.
-
----
-
-## 7. Inclusion-Exclusion Principle
-
-**History:** da Vinci used inclusion-exclusion ideas to compute areas; Sylvester (1882) formalized the principle. Inclusion-exclusion handles overlapping intersections — direct addition double-counts intersections, requiring successive corrections.
-
-Basic form: |A₁∪...∪A_n| = Σ|A_i| − Σ|A_i∩A_j| + ... ± |A₁∩...∩A_n|. Complement counting: "not having property P" = total − "having property P."
-
-**Derangements:** D(n) = n! − C(n,1)(n−1)! + C(n,2)(n−2)! − ... = n!Σ(−1)^k/k! ≈ n!/e as n→∞. Probability form: P(A₁∪...∪A_n) = ΣP(A_i) − ΣP(A_i∩A_j) + ...
-
----
-
-## 8. Recurrence Relations
-
-**Fibonacci sequence:**
-$$F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}$$
-- Generating function: F(x) = ΣF_n x^n = x/(1−x−x²)
-- Binet's formula: F_n = (φ^n − ψ^n)/√5, where φ = (1+√5)/2 ≈ 1.618 (the golden ratio)
-
-**Tower of Hanoi:**
-$$T_1 = 1, T_n = 2T_{n-1} + 1$$
-- Solution: T_n = 2^n − 1. A tower of 64 disks requires 2^{64} − 1 ≈ 1.8×10^{19} moves
-
-**Solving recurrences via generating functions:**
-1. Multiply the recurrence by x^n, sum over n → obtain an equation for A(x)
-2. Use initial conditions to solve for A(x) (algebraic or differential equation)
-3. Extract a_n: partial fractions, Taylor expansion, or matching against known power series
-
-**Catalan GF derivation:** C(x) = 1 + x·C(x)² → solve x·C² − C + 1 = 0 → C(x) = (1−√(1−4x))/(2x) → C_n = (1/(n+1))C(2n,n)
-
----
-
-## 9. Combinatorial Optimization
-
-**Minimum spanning tree:**
-- Kruskal (1956): greedily select edges in ascending order of weight, skipping those that form cycles, O(E log E)
-- Prim (1957): expand from a single vertex, each time selecting the minimum-weight connecting edge, O(E log V) (with a priority queue)
-
-**Max-flow min-cut:**
-- Ford-Fulkerson (1956): augmenting path method, incrementally increasing flow until no augmenting path exists
-- Max-flow min-cut theorem: the maximum flow value = the minimum cut capacity (the combinatorial manifestation of LP duality)
-- Edmonds-Karp (1972): BFS selects the shortest augmenting path, guaranteeing O(VE²)
-
-**Matching theory:**
-- Hungarian algorithm (Kuhn 1955): O(V³) maximum weighted bipartite matching
-- Edmonds' blossom algorithm (1965): maximum matching in general graphs, O(V³)
-
----
-
-## 10. The Twelvefold Way
-
-Richard P. Stanley, in **Enumerative Combinatorics Vol. 1**, unified and classified the 12 fundamental counting problems of placing n balls into k boxes (2×2×3: balls labeled/unlabeled × boxes labeled/unlabeled × any/at most one/at least one):
-
-| Balls | Boxes | Condition | Formula |
-|---|---|---|---|
-| distinct | distinct | any | k^n |
-| identical | distinct | any | C(n+k−1, k−1) |
-| distinct | identical | any | Σ S₂(n,i), i=1..k |
-| identical | identical | any | p_k(n) (restricted partitions) |
-| distinct | distinct | at most one ≤1 | P(k,n) = k!/(k−n)! |
-| identical | distinct | at most one ≤1 | C(k,n) |
-| distinct | identical | at most one ≤1 | 1 if n≤k, 0 otherwise |
-| identical | identical | at most one ≤1 | 1 if n≤k, 0 otherwise |
-| distinct | distinct | at least one ≥1 | k!·S₂(n,k) |
-| identical | distinct | at least one ≥1 | C(n−1, k−1) |
-| distinct | identical | at least one ≥1 | S₂(n,k) − S₂(n,k−1) |
-| identical | identical | at least one ≥1 | p_k(n) − p_{k−1}(n) |
-
-**Key insight:** The 2×2×3=12 fundamental counting problems cover the core scenarios in combinatorics. Use EGF for labeled objects, OGF for unlabeled objects. **Stirling numbers:** S₁(n,k) = the number of permutations of n elements with k cycles; S₂(n,k) = the number of ways to partition n elements into k non-empty subsets.
-
----
-
-*This file provides mathematical references and historical context for the discrete-combinatorial skill, covering core results from Euler to modern combinatorics.*

package/skills/discrete-combinatorial/original-texts.md

@@ -1,185 +0,0 @@
-# 离散与组合思想 — 原始文献与历史语境 / Discrete & Combinatorial Thinking — Original Texts & Historical Context
-
----
-
-## 1. Pigeonhole Principle — Dirichlet (1834) / 鸽巢原理 — Dirichlet (1834)
-
-Peter Gustav Lejeune Dirichlet 在 1834 年以"Schubfachprinzip"（抽屉原理）阐述鸽巢原理，用于数论存在性证明。
-
-> "Wenn man n + 1 Objecte in n Facher distribuiert, so ist mindestens ein Fach mit zwei Objecten besetzt."
-> — Dirichlet, 1834
-
-**核心陈述 / Core statement:**
-- 基本形式：若 n 物品放入 m 个盒子且 n > m，则某盒子含至少 ⌈n/m⌉ 个物品
-- 推广形式：kn+1 物品入 n 盒子 → 某盒至少含 k+1 个物品
-- 数论应用：对任意实数 α 和整数 N，存在 q ≤ N 使得 |qα − p| < 1/(N+1)（即 qα 逼近整数）
-
-**Diophantine 逼近 / Diophantine approximation:** 将 [0,1) 分为 N+1 个等长区间（"盒子"），考虑 N+2 个数 {0, {α}, {2α}, ..., {(N+1)α}}（"物品"），鸽巢保证必有两个落入同一区间，得 |(q₁−q₂)α − ⌊(q₁−q₂)α⌋| < 1/(N+1)。这是 Dirichlet 逼近定理的标准鸽巢证明。
-
----
-
-## 2. Euler's Generating Functions (1748) / Euler 的生成函数 (1748)
-
-Leonhard Euler 在 **Introductio in analysin infinitorum** (1748) 中开创生成函数方法——序列变换为幂级数，计数变换为代数运算。
-
-> "If we ask how many ways a given number can be partitioned, we are led to a study of the generating function." — Euler, 1748
-
-**分拆函数生成函数 / Partition GF:**
-$$P(x) = \sum_{n=0}^{\infty} p(n) x^n = \prod_{k=1}^{\infty} \frac{1}{1-x^k}$$
-- p(n) = 将 n 分为正整数之和的分拆数。p(5) = 7：{5, 4+1, 3+2, 3+1+1, 2+2+1, 2+1+1+1, 1+1+1+1+1}
-- 乘积形式：1/(1−x^k) = 1+x^k+x^{2k}+... 表示"取 k 的 0,1,2,... 次"，各 k 独立故乘积编码组合
-
-**五角数定理 / Pentagonal number theorem (Euler 1750):**
-$$\prod_{k=1}^{\infty}(1-x^k) = \sum_{m=-\infty}^{\infty} (-1)^m x^{m(3m-1)/2}$$
-- 广义五角数 e_m = m(3m−1)/2：0, 1, 2, 5, 7, 12, 15, 22, ...
-- 由 P(x)·∏(1−x^k) = Σ(−1)^m x^{e_m}，得递推 p(n) = p(n−1)+p(n−2)−p(n−5)−p(n−7)+...
-- 这是有限递推控制无限序列的经典实例——组合思想的精髓
-
-**Hardy-Ramanujan 渐近公式 (1918):**
-$$p(n) \sim \frac{1}{4n\sqrt{3}} \exp\left(\pi\sqrt{\frac{2n}{3}}\right)$$
-
----
-
-## 3. Catalan Numbers / Catalan 数
-
-**历史 / History:** Eugène Catalan (1838) 研究括号嵌套的计数问题，Catalan 数由此得名。但 Euler 早在 1751 年就研究过类似问题（多边形三角剖分）。
-
-**定义与公式 / Definition and formula:**
-$$C_n = \frac{1}{n+1}\binom{2n}{n} = \frac{(2n)!}{n!(n+1)!}$$
-- 递推：C₀ = 1, C_n = ΣC_i·C_{n−1−i}
-- 生成函数：C(x) = ΣC_n x^n = (1−√(1−4x))/(2x)，由 C(x) = 1 + x·C(x)² 解得
-
-**组合解释（60+种） / Combinatorial interpretations (60+):**
-- **二叉树**：n 个节点的有序二叉树数 = C_n
-- **Dyck 路径**：从 (0,0) 到 (2n,0) 的格点路径，每步 (+1,+1) 或 (+1,−1)，不越 y=0
-- **括号序列**：n 对括号的合法嵌套方式数 = C_n
-- **投票问题 (Ballot problem)**：A 得 n+1 票、B 得 n 票，A 全程领先 B 的序列数 = C_n（Bertrand 1887）
-- **多边形三角剖分**：n+2 边形的不同三角剖分数 = C_n
-
-前几项：C₀=1, C₁=1, C₂=2, C₃=5, C₄=14, C₅=42, C₆=132
-
----
-
-## 4. Ramsey Theory — Ramsey (1930) / Ramsey 理论 — Ramsey (1930)
-
-Frank P. Ramsey 在 **"On a Problem of Formal Logic"** (1930) 中证明：足够大的系统必存在某种结构——鸽巢原理的深刻推广。
-
-> "In any sufficiently large system, complete disorder is impossible." — Cohen
-
-**Ramsey 数 / Ramsey numbers:**
-$$R(s,t) = \min\{n : \text{任意 } n \text{ 阶 2-色完全图中必有红 } K_s \text{ 或蓝 } K_t\}$$
-
-**已知值:** R(3,3)=6（6人聚会必有3人互识或互不识；证明：固定一人，5人中至少3人同色关系（鸽巢），此3人中若2人同色则3人组，否则此3人构成另一色3人组）, R(4,4)=18, R(3,4)=9, R(3,5)=14.
-
-**一般界:** Erdős 1947 概率方法: R(k,k) > 2^{k/2}; 上界 R(k,k) ≤ 4^k. R(5,5)未知(43≤R(5,5)≤48). Erdős："外星人要R(5,5)就动员所有计算机；要R(6,6)就准备战斗。"
-
----
-
-## 5. Graph Theory — Euler (1736) / 图论 — Euler (1736)
-
-**Königsberg 七桥问题 / Seven Bridges of Königsberg (1736):**
-
-Leonhard Euler 在 **"Solutio problematis ad geometriam situs pertinentis"** (1736) 解决柯尼斯堡七桥问题，开创图论。
-
-> "The problem... is to find whether one can cross each of the seven bridges exactly once and return to the starting point." — Euler, 1736
-
-**Euler 环定理 / Euler circuit theorem:**
-- 连通图存在 Euler 环（经过每边恰好一次的闭路径）iff 所有顶点度数为偶数
-- 柯尼斯堡图：4 个顶点度数为 3, 3, 3, 5（均为奇数），故 Euler 环不存在——问题无解
-
-**Euler 平面图公式 / Euler's planar formula (1750):**
-$$V - E + F = 2$$
-- 对任意连通平面图：顶点数 V、边数 E、面数 F 满足此公式
-- 推论：简单连通平面图 E ≤ 3V − 6；不含 K₃ 的平面图 E ≤ 2V − 4
-
-**匹配理论 / Matching theory:**
-- König (1931)：二分图中最大匹配数 = 最小顶点覆盖数（König 定理）
-- Hall 婚姻定理 (1935)：二分图 G(X,Y) 有 X 到 Y 的完美匹配 iff 对任意 S ⊆ X，|N(S)| ≥ |S|
-
----
-
-## 6. Pólya Enumeration Theorem (1937) / Pólya 计数定理 (1937)
-
-George Pólya 在 1937 年的论文中给出对称性下的计数方法——轨道计数定理，组合计数与群论的交汇点。
-
-> "The number of distinct colorings is obtained by averaging over the group action." — Pólya, 1937
-
-**定理陈述 / Theorem statement:**
-设群 G 作用于集合 X，k-着色等价类数（轨道数）:
-$$N = \frac{1}{|G|} \sum_{g \in G} k^{c(g)}$$
-c(g) = 置换 g 的循环数。应用: 化学异构体、珠串图案。Burnside 引理 (1897): N = (1/|G|)Σ|Fix(g)|，是 Pólya 特例。Pólya 推广为带权版本: GF × 循环指数 = 对称计数。
-
----
-
-## 7. Inclusion-Exclusion Principle / 容斥原理
-
-**历史:** da Vinci 用容斥思想计算面积；Sylvester (1882) 形式化。容斥处理交集重叠——直接相加重计交集，需逐层修正。
-
-基本形式: |A₁∪...∪A_n| = Σ|A_i| − Σ|A_i∩A_j| + ... ± |A₁∩...∩A_n|. 补集计数: "不具有P" = 全部 − "具有P".
-
-**错排数:** D(n) = n! − C(n,1)(n−1)! + C(n,2)(n−2)! − ... = n!Σ(−1)^k/k! ≈ n!/e (n→∞). 概率形式: P(A₁∪...∪A_n) = ΣP(A_i) − ΣP(A_i∩A_j) + ...
-
----
-
-## 8. Recurrence Relations / 递推关系
-
-**Fibonacci 数列 / Fibonacci sequence:**
-$$F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}$$
-- 生成函数：F(x) = ΣF_n x^n = x/(1−x−x²)
-- Binet 公式：F_n = (φ^n − ψ^n)/√5，φ = (1+√5)/2 ≈ 1.618（黄金比）
-
-**汉诺塔 / Tower of Hanoi:**
-$$T_1 = 1, T_n = 2T_{n-1} + 1$$
-- 解：T_n = 2^n − 1。64 层需 2^{64} − 1 ≈ 1.8×10^{19} 步
-
-**GF 求解递推 / Solving recurrences via GF:**
-1. 递推乘以 x^n，对 n 求和 → A(x) 的方程
-2. 利用初始条件，解出 A(x)（代数/微分方程）
-3. 提取 a_n：部分分式、Taylor 展开、幂级数对照
-
-**Catalan GF 推导:** C(x) = 1 + x·C(x)² → 解 x·C² − C + 1 = 0 → C(x) = (1−√(1−4x))/(2x) → C_n = (1/(n+1))C(2n,n)
-
----
-
-## 9. Combinatorial Optimization / 组合优化
-
-**最小生成树 / Minimum spanning tree:**
-- Kruskal (1956)：按边权升序贪心选取不成环的边，O(E log E)
-- Prim (1957)：从单点扩展，每次选最小权连接边，O(E log V)（优先队列）
-
-**最大流最小割 / Max-flow min-cut:**
-- Ford-Fulkerson (1956)：增广路径法，流量逐步增加直至无增广路径
-- 最大流最小割定理：最大流值 = 最小割容量（LP 对偶性的组合表现）
-- Edmonds-Karp (1972)：BFS 选最短增广路径，保证 O(VE²)
-
-**匹配理论 / Matching theory:**
-- Hungarian 算法 (Kuhn 1955)：O(V³) 最大加权二分匹配
-- Edmonds 带花树算法 (1965)：一般图最大匹配，O(V³)
-
----
-
-## 10. The Twelvefold Way / 十二重道
-
-Richard P. Stanley 在 **Enumerative Combinatorics Vol. 1** 中统一分类 n球入k盒的12种基本计数(2×2×3: 球有标号/无标号 × 盒有标号/无标号 × 任意/至多1/至少1):
-
-| 球 / Balls | 盒子 / Boxes | 条件 / Condition | 公式 / Formula |
-|---|---|---|---|
-| 有标号 distinct | 有标号 distinct | 任意 any | k^n |
-| 无标号 identical | 有标号 distinct | 任意 any | C(n+k−1, k−1) |
-| 有标号 distinct | 无标号 identical | 任意 any | Σ S₂(n,i), i=1..k |
-| 无标号 identical | 无标号 identical | 任意 any | p_k(n)（受限分拆） |
-| 有标号 distinct | 有标号 distinct | 至多一个 ≤1 | P(k,n) = k!/(k−n)! |
-| 无标号 identical | 有标号 distinct | 至多一个 ≤1 | C(k,n) |
-| 有标号 distinct | 无标号 identical | 至多一个 ≤1 | 1 if n≤k, 0 else |
-| 无标号 identical | 无标号 identical | 至多一个 ≤1 | 1 if n≤k, 0 else |
-| 有标号 distinct | 有标号 distinct | 至少一个 ≥1 | k!·S₂(n,k) |
-| 无标号 identical | 有标号 distinct | 至至少一个 ≥1 | C(n−1, k−1) |
-| 有标号 distinct | 无标号 identical | 至少一个 ≥1 | S₂(n,k) − S₂(n,k−1) |
-| 无标号 identical | 无标号 identical | 至少一个 ≥1 | p_k(n) − p_{k−1}(n) |
-
-**关键洞察:** 2×2×3=12种基本计数覆盖组合数学核心场景。有标号用EGF，无标号用OGF。**Stirling数:** S₁(n,k)=n元素k循环排列数; S₂(n,k)=n元素k非空子集数。
-
----
-
-*本文件为离散与组合思想技能的数学参考与历史语境，涵盖从 Euler 到现代组合数学的核心成果。*
-*This file provides mathematical references and historical context for the discrete-combinatorial skill, covering core results from Euler to modern combinatorics.*

package/skills/game-theory/SKILL.en.md

@@ -1,117 +0,0 @@
----
-name: game-theory
-description: |
-  Trigger when optimal strategy depends on others' choices, needing Nash equilibrium computation, zero-sum/non-zero-sum analysis, mechanism design; or designing strategies for multi-agent systems, adversarial training, routing games.
----
-
-# 🎯 Game Theory
-
-> "Your optimal choice depends on others' choices — thinking must be interactive, not just deep."
->
-> — Game Theory, Decision Theory, Mechanism Design
-
-## Core Principle
-
-**Strategic interaction — your best action depends on what others do, and theirs depend on what you do. Nash equilibrium: strategy profile where no player benefits from unilateral deviation.**
-
-Key concepts: **Payoff Matrix**, **Dominant Strategy**, **Mixed Strategy**, **Pareto Optimality**. Classification dimensions: cooperative vs. non-cooperative, zero-sum vs. general-sum, simultaneous vs. sequential.
-
-> **Mathematical Formalization**
->
-> Formal definition: $n$ players, each with strategy set $S_i$ and payoff function $u_i: S_1 \times \cdots \times S_n \to \mathbb{R}$.
->
-> Nash equilibrium: strategy profile $s^* = (s_1^*, \ldots, s_n^*)$ satisfying $u_i(s^*) \geq u_i(s_i, s^*_{-i})$ for all $s_i \in S_i$ and all $i$, where $s^*_{-i}$ denotes the strategies of all players except $i$. Mixed-strategy Nash equilibrium: probability distribution $\sigma^*$ such that $u_i(\sigma^*) \geq u_i(s_i, \sigma^*_{-i})$.
->
-> Dominant strategy: strict $u_i(s_i^*, s_{-i}) > u_i(s_i, s_{-i})$; weak dominance $\geq$ with at least one strict inequality.
->
-> Zero-sum minimax: $\max_x \min_y f(x,y) = \min_y \max_x f(x,y)$.
-
-## GPU-Friendliness (Cross-Cutting Check)
-
-Game-solving maps to GPU with widely varying capability; pass through the eight-dimensional gate in `../../references/gpu-friendly-math.md`:
-
-- **Matrix games / two-player zero-sum (minimax)**: Equivalent to linear programming (LP); payoff matrix operations are GEMM-compatible and batch-parallelizable — **friendly**.
-- **Mixed-strategy equilibrium computation**: Linear systems / indifference equations on the support; small-scale problems are batch-solvable; watch for sparsity and condition number at scale.
-- **Exact large-scale multi-agent equilibrium**: $n$-player Nash equilibrium is PPAD-complete; general case is **intractable** → **anti-pattern**; switch to approximate / learning-based methods (fictitious play, self-play, multi-agent RL, NFSP).
-- **Evolutionary / repeated game simulation**: Population and strategy batch updates are parallelizable; watch for inter-agent communication and synchronization overhead.
-
-Eight-dimensional minimum assessment (formal terms): **Tensorization** — whether players / strategies / rounds admit batched unfolding; **GEMM-mappability** — whether payoff matrices, minimax, LP / linear systems fall into matrix operations; **Complexity** — flag PPAD / combinatorial explosion risks for Nash / mechanism solving; **Memory and KV-Cache** — whether the strategy-state Cartesian product is compressible; **Low-precision stability** — whether equilibrium solving, LP, soft best-response have controlled condition numbers; **Parallelism and communication** — synchronization cost of multi-agent rollouts; **Sparse structure** — whether the interaction graph is structured; **Operator fusion** — whether payoff, mask, and best-response updates can be fused.
-
-> Use in conjunction with `../../references/books/optimization-ml.md` (duality / minimax, game learning algorithms) and `../../references/books/matrix-analysis.md` (matrix games, linear systems).
-
-## When NOT to Use
-
-- **Single-agent decision problems with no interaction** — optimization thinking is more appropriate; no need to model others' strategic responses.
-- **Purely cooperative problems with no conflict of interest** — players' objectives are fully aligned; strategic analysis is unnecessary.
-- **Deterministic problems with no strategic uncertainty** — outcomes are uniquely determined by one's own actions; no reaction from others is involved.
-- **Outcomes determined purely by chance with no strategic choice** — no strategy sets to analyze; game theory does not apply.
-
-## When to Use
-
-- Multiple decision-makers interact; each player's strategy affects others' payoffs; the optimal strategy depends on predicting others' responses.
-- Need to design incentive mechanisms so that self-interested behavior leads to socially optimal outcomes; predict equilibrium states under given rules.
-- Analyze pricing, entry, and exit in competitive markets; benefit allocation and threat points in negotiation / bargaining.
-- **Design strategies and equilibrium objectives for multi-agent systems, adversarial training (GAN / robust learning), and routing games.**
-
-## Method
-
-### Step 1: Identify Players and Strategies
-Define the fundamental elements of the game: players $N=\{1,\ldots,n\}$; strategy sets $S_i$; payoff functions $u_i: S_1\times\cdots\times S_n\to\mathbb{R}$; information structure (symmetric or not? incomplete information? sequential actions? communication possible?). The core task is identifying the "interaction structure" — whose choices affect whose outcomes. Missing a key player is the most common error.
-
-### Step 2: Analyze the Game Type
-First classify: zero-sum / general-sum, simultaneous / sequential, cooperative / non-cooperative, complete / incomplete information. The type determines the method: zero-sum uses minimax / LP; sequential games use backward induction and subgame-perfect equilibrium; cooperative games use the Shapley value to allocate by marginal contribution:
-$$\phi_i(v)=\sum_{S\subseteq N\setminus\{i\}}\frac{|S|!(n-|S|-1)!}{n!}[v(S\cup\{i\})-v(S)]$$
-Misclassifying the type leads directly to applying the wrong equilibrium concept and solution method.
-
-### Step 3: Construct the Payoff Matrix / Function
-For two-player games, use a payoff matrix with cells $(u_1,u_2)$; for $n$-player games, use $u_i(s_1,\ldots,s_n)$. Verify completeness: are any players or strategies missing? Do payoffs accurately reflect preferences? Are there externalities? Payoffs are the foundation of all analysis; inaccurate assessment biases everything downstream.
-
-### Step 4: Search for Dominant Strategies
-Strict dominance: $u_i(s_i^*,s_{-i}) > u_i(s_i,s_{-i})$ for all $s_i\neq s_i^*$ and all $s_{-i}$; weak dominance: $\geq$ with at least one strict inequality. **Iterated elimination of dominated strategies** successively removes inferior strategies to shrink the strategy space. A dominant-strategy equilibrium is the strongest possible conclusion — no player has any incentive to deviate. If none exists, proceed to equilibrium analysis.
-
-### Step 5: Compute Equilibria
-Select the method based on the game type from Step 2. Pure-strategy Nash: for each $s_{-i}$, find the best response $BR_i(s_{-i})$; intersections are equilibria. Mixed strategies: find probability distributions that make others indifferent, $u_j(s_j,\sigma^*_{-j})=u_j(s_j',\sigma^*_{-j})$ for all $s_j,s_j'\in S_j$. Zero-sum matrix games use minimax $\max_x\min_y f=\min_y\max_x f$; sequential games use backward induction; cooperative games output allocation schemes rather than standard Nash. For multiple equilibria, perform Pareto ranking and label optimal vs. inferior equilibria.
-
-### Step 6: Check Equilibrium Stability
-Trembling-hand perfection (stable under small perturbations, excluding equilibria that rely on "opponents never make mistakes"); evolutionarily stable strategy ESS (resists invasion in repeated interactions); off-equilibrium-path incentives (in sequential games, whether there is motivation to honor commitments). Ask: is the equilibrium unique or multiple? Is it robust to small perturbations? Only stable equilibria constitute credible predictions.
-
-### Step 7: Mechanism Design and Improvement
-If no good equilibrium exists, redesign the game: modify the payoff structure (incentives and penalties), add enforceable rules, introduce communication and reputation mechanisms, Vickrey auctions (truthful valuation reporting is a dominant strategy). Mechanism design formalization:
-$$\max\ \text{social welfare}\quad\text{s.t.}\quad\text{incentive compatibility + individual rationality}$$
-The revelation principle: any Bayesian game equilibrium can be implemented by a direct mechanism — truthful type reporting is an equilibrium. Mechanism design is the most practical branch — rather than lamenting non-cooperation, change the rules so that cooperation becomes the self-interested choice.
-
-## Common Errors
-
-| Error | Critique | Correct Approach |
-|---|---|---|
-| Assuming others think the same way you do | Others have different payoff functions / rationality levels; $u_i\neq u_j$ | Explicitly specify each player's payoff function and beliefs |
-| Ignoring mixed strategies | Pure-strategy equilibria may not exist; mixed equilibria always exist (Nash, 1950) | Check whether mixed-strategy analysis is needed |
-| Confusing Nash equilibrium with Pareto optimality | Nash equilibrium can be Pareto-dominated (Prisoner's Dilemma); the two are independent | Separately annotate equilibrium properties and efficiency properties |
-| Ignoring information asymmetry | Incomplete-information equilibria differ fundamentally from complete-information ones | Distinguish Bayesian games from complete-information games |
-| Oversimplifying payoff structure | Omitting key payoff dimensions distorts the equilibrium | Systematically check complete payoffs for all players |
-| Ignoring repeated interaction dynamics | One-shot equilibria may change in repeated games (folk theorem) | Analyze subgame-perfect equilibria |
-| Intractable exact large-scale equilibrium | $n$-player Nash equilibrium is PPAD-complete; exact solutions are infeasible | Pass through the GPU eight-dimensional gate; switch to approximate / learning methods (self-play, MARL) |
-
-## Operating Procedure
-
-When this skill is triggered, the output must include:
-
-1. **[Players]**: All decision-makers and their types (rational / boundedly rational / unknown).
-2. **[Strategy Sets]**: Available strategies for each player; label finite / infinite.
-3. **[Payoff Matrix]**: Payoff values $(u_1,u_2,\ldots)$ for core strategy profiles, or payoff function form.
-4. **[Game Type]**: Zero-sum / non-zero-sum / sequential / cooperative, with corresponding analytical method.
-5. **[Equilibria]**: All applicable equilibria (pure strategy, mixed strategy, subgame-perfect, cooperative allocation, etc.); label multiple equilibria.
-6. **[Stability]**: Trembling-hand perfection, evolutionary stability, off-equilibrium-path incentives.
-7. **[Mechanism Recommendations]**: If equilibria are undesirable, propose mechanism design suggestions (modify payoffs, add rules, introduce reputation, etc.).
-8. **[GPU Feasibility]**: Matrix games / minimax → LP is GEMM-compatible; large-scale multi-agent equilibria may be intractable → approximate / learning methods; pass through the eight-dimensional gate.
-
-**Output must not consist of analysis alone without conclusions.**
-
-## Relations to Other Skills
-
-- **Optimization Thinking**: Nash equilibrium is mutual optimization — each player optimizes their own payoff subject to others' strategies; the equilibrium is the common solution to all optimization problems.
-- **Probability and Statistics**: Mixed strategies select actions via probability distributions; Bayesian games handle type uncertainty probabilistically; equilibria depend on expected payoffs.
-- **Information Theory Thinking**: Information asymmetry and signaling — in Spence signaling games, the information structure directly affects equilibrium existence and properties.
-- **Causal Inference Thinking**: Strategic choices causally affect others' payoffs; causal chains in strategic interaction are bidirectional.
-- **Algorithmic Thinking**: Nash equilibrium computation complexity (PPAD-complete), Lemke-Howson algorithm, evolutionary game simulation.
-- **Modern Mathematics Activation**: `../../references/books/optimization-ml.md` (duality / minimax, game learning algorithms), `../../references/books/matrix-analysis.md` (matrix games, linear algebraic structure of payoff matrices).