Skip to content

Commit

Permalink
feat: upload
Browse files Browse the repository at this point in the history
  • Loading branch information
Tiphereth-A committed Apr 1, 2024
1 parent 7cc1565 commit dabb2e3
Show file tree
Hide file tree
Showing 4 changed files with 51 additions and 5 deletions.
1 change: 1 addition & 0 deletions config.yml
Original file line number Diff line number Diff line change
Expand Up @@ -1295,6 +1295,7 @@ cheatsheets:
decimal: Python Decimal
bash: Bash 简单用法
lgv: lgv 定理
young: Young 表
default_code_style: common
code_styles:
C: cpp
Expand Down
29 changes: 29 additions & 0 deletions src/cheatsheet/formula.tex
Original file line number Diff line number Diff line change
Expand Up @@ -102,6 +102,35 @@ \subsubsection{Stirling 数相关公式}

\subsubsection{Burnside 引理}

\(G\) 为置换群, \(X\) 为一集合, 则

\[
|X/G|=\frac{1}{|G|}\sum_{g\in G}\left|X^g\right|
\]

其中 \(X^g:=\{x\in X:gx=x\}\) 表示 \(X\) 中关于 \(g\) 的稳定化子

推论(P\'olya 定理):

\[
\left|Y^X/G\right|=\frac{1}{|G|}\sum_{g\in G} |Y|^{c(g)}
\]

其中 \(c(g)\) 为置换 \(g\) 能拆成的不相交循环置换的数量

推论: 设 \(f(k)\) 为对长为 \(k\) 的序列按固定顺序计数的结果, 此时可令 \(G=\mathbb{Z}_n\), 从而

\[
g(n)=\frac{1}{n}\sum_{k=0}^{n-1}f(\gcd(n,k))=\frac{1}{n} \{f*\varphi\}(n)
\]

其中 \(*\) 为 Dirichlet 卷积

如: 长为 \(n\) 的项链, 珠子可以染 \(m\) 种颜色, 则总方案数为

\[
\frac{1}{n}\sum_{k=0}^{n-1} m^{\gcd(n,k)}
\]

\subsection{初等数论}

Expand Down
20 changes: 20 additions & 0 deletions src/cheatsheet/young.tex
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
\subsection{定义}

\begin{itemize}
\item[Young 图] 形状为 \(\lambda=(\lambda_1,\dots,\lambda_k)\) (\(\lambda_1\geq \dots\geq \lambda_k\)) 的 Young 图为一个左对齐的, 由若干方格构成的图, 第 \(i\) 行有 \(\lambda_i\) 个方格.
\item[Young 表] 在形状为 \(\lambda\) 的 Young 图的方块中填入长度为 \(\sum_k \lambda_k\) 的排列, 使得每一行(从左到右)每一列(从上到下)都是单调递增的, 得到的图形即为形状为 \(\lambda\) 的 Young 表.
\end{itemize}

\subsection{勾长公式}

对形状为 \(\lambda\) 的 Young 表, 位置为 \((i,j)\) 的方格的勾长定义为

\[
h_{\lambda}(i,j):=\left|\left\{(I,J):i\leq I, j\leq J,(i=I \lor j=J)\right\}\right|
\]

则形状为 \(\lambda\) 的 Young 表总数为

\[
\frac{n!}{\prod_{i,j} h_{\lambda}(i,j)}
\]
6 changes: 1 addition & 5 deletions src/test_cpverifier/unit-test/enum/gosper.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -36,11 +36,7 @@ int main() {
case tifa_libs::unittest::ts_random_02: test<1>(5, 5); break;
case tifa_libs::unittest::ts_random_03: test<1>(6, 6); break;
case tifa_libs::unittest::ts_random_04: test<2>(10, 10); break;
case tifa_libs::unittest::ts_random_05: test<2>(20, 20); break;
case tifa_libs::unittest::ts_random_06: test<2>(30, 10); break;
case tifa_libs::unittest::ts_random_07: test<2>(40, 8); break;
case tifa_libs::unittest::ts_random_08: test<2>(50, 7); break;
case tifa_libs::unittest::ts_random_09: test<2>(60, 6); break;
case tifa_libs::unittest::ts_random_05: test<2>(20, 5); break;
default: break;
}

Expand Down

0 comments on commit dabb2e3

Please sign in to comment.