Faà di Bruno's formula and inversion of power series (Q2065930)

Faà di Bruno's formula published in 1857 concerns the derivatives of the superposition \(f \circ g\). If \([n] = \{ 1, 2, \ldots , n \}\), then \[ D^n [f \circ g] = \sum\limits_{\pi \in \mathcal{P}_{[n]}} (D^{\# \pi} [f] \circ g) \prod\limits_{\Gamma \in \pi} D^{\# \Gamma} [g], \] where the sum ranges over \(\mathcal{P}_{[n]}\), the collection of set partitions of \([n]\), \(\# \pi\) counts the number of blocks in the partition \(\pi\), and \(\# \Gamma\) counts the number of elements of a block \(\Gamma\). The main result of the paper is a multivariate version of Faà di Bruno's formula in higer dimensions: Theorem. The function \(D_i^{\alpha} [F^{(1)} \circ \ldots \circ F^{(m)}] : \mathbb{R}^N \to \mathbb{R}\) is given by \[ D_i^{\alpha} [F^{(1)} \circ \ldots \circ F^{(m)}] (s) = \sum\limits_{\mathcal{T} \in \mathbb{F}_{i, \alpha} (m)} \mathcal{E}_{F^*} (\mathcal{T})(s). \] where \(F^* = (F^{(1)}, \ldots , F^{(m)})\) is an m-tuple of smooth functions from \(\mathbb{R}^N\) to \(\mathbb{R}^N\), \(\mathcal{T}\) is a finite tree with a root vertex \(v_0\), \(V_k\) denote the set of vertices whose graph distance from the root is \(k\), \(\pi_{i,s}\) is the set of trees with root type \(i\) and leaf types \(S\) (\(S\) is a finite subset of \([N] \times \mathbb{Z}_{\geqslant 0}\)), \(\mathbb{F}_{i, \alpha} (m)\) the set of final trees of length \(m\) and finally \[ \mathcal{E}_{F^*} (\mathcal{T}) := \prod\limits_{l=1}^{m} \prod\limits_{v \in V_{l-1}} D_{\tau(v)}^{\mu(v)} [F^{(l)}] \circ F^{(l+1)} \circ \dots \circ F^{(m)}. \] is the energy function \(\mathcal{E}_{F^*} (\mathcal{T})\). The paper is organized in the following way: Ssection 1 is an introduction, Sections 2 and 3 present the full statements of Faà di Bruno's formula and the inversion formula for multivariate power series in the commutative and non-commutative case, respectively. Section 4 includes several applications of both formulas, among others a representation for the Hermite polynomials in terms of partitions, in Sections 5 and 6 there are the proofs of the results formulated in Section 2 and 3. An important part of Section 2 is a combinatorial formulation of the Jacobian conjecture (Conjecture 2.9 on page 18), based on a result of \textit{H. Bass} et al. [Bull. Am. Math. Soc., New Ser. 7, 287--330 (1982; Zbl 0539.13012)] and a brief overview of results connected with the Jacobian conjecture.