Lagrange Inversion Formula
P r o o f : Proof: Proof: https://users.math.msu.edu/users/magyarp/Math880/Lagrange.pdf
**Generalization: ** For inverse functions with
g
(
f
(
x
)
)
=
x
g(f(x)) = x
g(f(x))=x，we can use the same reasoninng to expand
h
(
g
(
x
)
)
h(g(x))
h(g(x)) for any
h
(
x
)
h(x)
h(x) with
h
(
0
)
=
0
:
h(0) =0:
h(0)=0:
[
x
n
]
h
(
g
(
x
)
)
=
1
n
[
x
−
1
]
h
′
(
x
)
f
(
x
)
n
[x^n]h(g(x))=\frac{1}{n}[x^{-1}]\frac{h^{'}(x)}{f(x)^n}
[xn]h(g(x))=n1[x−1]f(x)nh′(x)
Eulerian Number
https://blog.csdn.net/weixin_42426064/article/details/108720990
O
r
z
O
r
z
O
r
z
O
r
z
∣
n
k
∣
=
∑
i
=
k
n
(
i
k
)
⟨
n
i
⟩
⇒
⟨
n
k
⟩
=
∑
i
=
k
n
(
i
k
)
(
−
1
)
i
−
k
∣
n
i
∣
∵
∣
n
k
∣
=
n
!
[
x
n
]
(
e
x
−
1
)
n
−
k
(
E
G
F
)
∴
⟨
n
k
⟩
=
n
!
∑
i
=
k
n
(
i
k
)
(
−
1
)
i
−
k
[
x
n
]
(
e
x
−
1
)
n
−
i
OrzOrzOrzOrz \\ \left|\begin{matrix}n\\k\end{matrix}\right| =\sum_{i=k}^n \binom{i} {k}\left\langle\begin{matrix}n\\i\end{matrix}\right\rangle \Rightarrow \left\langle\begin{matrix}n\\k\end{matrix}\right\rangle=\sum_{i=k}^n \binom{i}{k}(-1)^{i-k}\left|\begin{matrix}n\\i\end{matrix}\right| \\ \begin{aligned} \because \left|\begin{matrix}n\\k\end{matrix}\right| =& n^{n-k} \quad \quad (EGF)\\ \therefore \left\langle\begin{matrix}n\\k\end{matrix}\right\rangle =& n!\sum_{i=k}^n \binom{i}{k}(-1)^{i-k}[x^n](e^x-1)^{n-i} \end{aligned} \\
OrzOrzOrzOrz∣∣∣∣nk∣∣∣∣=i=k∑n(ki)⟨ni⟩⇒⟨nk⟩=i=k∑n(ki)(−1)i−k∣∣∣∣ni∣∣∣∣∵∣∣∣∣nk∣∣∣∣=∴⟨nk⟩=nn−k(EGF)n!i=k∑n(ki)(−1)i−k[xn](ex−1)n−i
那么每位的贡献为
%
%
%
%
%
%
%
A
n
s
[
k
]
=
∑
i
=
k
n
(
n
i
)
(
n
−
i
)
!
i
!
∑
j
=
k
i
(
j
k
)
(
−
1
)
j
−
k
[
x
i
]
(
e
x
−
1
)
i
−
j
=
n
!
∑
i
=
k
n
∑
j
=
k
i
(
j
k
)
(
−
1
)
j
−
k
[
x
i
]
(
e
x
−
1
)
i
−
j
=
n
!
k
!
∑
j
=
k
n
(
−
1
)
j
−
k
j
!
(
j
−
k
)
!
∑
i
=
j
n
[
x
i
]
(
e
x
−
1
)
i
−
j
S
[
k
]
=
∑
i
=
k
n
[
x
i
]
(
e
x
−
1
)
i
−
k
=
n
!
k
!
∑
j
=
k
n
(
−
1
)
j
−
k
(
j
−
k
)
!
S
[
j
]
j
!
\%\%\%\%\%\%\% \\ \begin{aligned} Ans[k] =& \sum_{i=k}^n \binom{n}{i}(n-i)!i!\sum_{j=k}^i \binom{j}{k}(-1)^{j-k}[x^i](e^x-1)^{i-j} \\ =& n!\sum_{i=k}^n\sum_{j=k}^i\binom{j}{k}(-1)^{j-k}[x^i](e^x-1)^{i-j} \\ =& \frac{n!}{k!}\sum_{j=k}^n \frac{(-1)^{j-k}j!}{(j-k)!}\sum_{i=j}^n[x^i](e^x-1)^{i-j} \end{aligned} \\ \begin{aligned} S[k] =& \sum_{i=k}^n[x^i](e^x-1)^{i-k} \\ =& \frac{n!}{k!}\sum_{j=k}^n\frac{(-1)^{j-k}}{(j-k)!}S[j]j! \end{aligned}
%%%%%%%Ans[k]===i=k∑n(in)(n−i)!i!j=k∑i(kj)(−1)j−k[xi](ex−1)i−jn!i=k∑nj=k∑i(kj)(−1)j−k[xi](ex−1)i−jk!n!j=k∑n(j−k)!(−1)j−kj!i=j∑n[xi](ex−1)i−jS[k]==i=k∑n[xi](ex−1)i−kk!n!j=k∑n(j−k)!(−1)j−kS[j]j!
https://www.cnblogs.com/s-z-q/p/13347914.html
对
S
[
k
]
S[k]
S[k]差卷积，二元GF操作后可得（还不太会，前面的过程也只是看了聚聚才弄出来，留个结果咕了）
[
x
n
−
m
+
1
]
m
H
(
x
)
n
+
1
1
−
H
(
x
)
+
[
x
n
−
m
]
H
′
(
x
)
H
(
x
)
n
+
1
(
1
−
H
(
x
)
)
2
H
(
x
)
=
x
l
n
(
x
+
1
)
[x^{n-m+1}]m\frac{H(x)^{n+1}}{1-H(x)}+[x^{n-m}]\frac{H^{'}(x)H(x)^{n+1}}{(1-H(x))^2} \\ H(x)=\frac{x}{ln(x+1)}
[xn−m+1]m1−H(x)H(x)n+1+[xn−m](1−H(x))2H′(x)H(x)n+1H(x)=ln(x+1)x
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
