##定义
G
n
=
∑
i
=
0
n
a
n
,
i
F
i
G_n=\sum_{i=0}^n a_{n,i}F_i
Gn=i=0∑nan,iFi
F
n
=
∑
i
=
0
n
b
n
,
i
G
i
F_n=\sum_{i=0}^n b_{n,i}G_i
Fn=i=0∑nbn,iGi
可认为 a a a、 b b b是两个下三角矩阵，且 a ⋅ b = I a \cdot b = I a⋅b=I
###二项式反演
G
n
=
∑
i
=
0
n
(
n
i
)
F
i
  
⟺
  
G
n
=
∑
i
=
0
n
(
−
1
)
n
−
i
(
n
i
)
F
i
G_n=\sum_{i=0}^n {n \choose i}F_i\iff G_n=\sum_{i=0}^n (-1)^{n-i}{n \choose i}F_i
Gn=i=0∑n(in)Fi⟺Gn=i=0∑n(−1)n−i(in)Fi
###斯特林反演
G
n
=
∑
i
=
0
n
{
n
i
}
F
i
  
⟺
  
F
n
=
∑
i
=
0
n
[
n
i
]
G
i
G_n=\sum_{i=0}^n \begin{Bmatrix} n\\i \end{Bmatrix}F_i\iff F_n=\sum_{i=0}^n \begin{bmatrix} n\\i \end{bmatrix}G_i
Gn=i=0∑n{ni}Fi⟺Fn=i=0∑n[ni]Gi
###莫比乌斯反演
f
n
=
∑
d
∣
n
g
d
  
⟺
  
g
n
=
∑
d
∣
n
μ
n
d
f
d
f_n=\sum_{d|n}g_d\iff g_n=\sum_{d|n}\mu_{\frac{n}{d}}f_d
fn=d∣n∑gd⟺gn=d∣n∑μdnfd
###集合形式
g S = ∑ T ⊆ S f T    ⟺    f S = ∑ T ⊆ S ( − 1 ) ∣ S ∣ − ∣ T ∣ g T g_S=\sum_{T \subseteq S} f_T \iff f_S = \sum_{T \subseteq S} (-1)^{|S|-|T|} g_T gS=T⊆S∑fT⟺fS=T⊆S∑(−1)∣S∣−∣T∣gT
###最值反演
max
{
S
}
=
∑
T
⊆
S
(
−
1
)
∣
T
∣
−
1
min
{
T
}
\max\{S\}=\sum_{T\subseteq S}(-1)^{|T|-1}\min\{T\}
max{S}=T⊆S∑(−1)∣T∣−1min{T}
###推广
k
t
h
max
(
S
)
=
∑
T
⊆
S
(
−
1
)
∣
T
∣
−
k
(
∣
T
∣
−
1
k
−
1
)
min
(
T
)
kth\max(S)=\sum_{T \subseteq S} (-1)^{|T|-k} {|T|-1 \choose k-1} \min(T)
kthmax(S)=T⊆S∑(−1)∣T∣−k(k−1∣T∣−1)min(T)
扫一扫
539
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
