Fa\`a di Bruno's formula and inversion of power series
Samuel G. G. Johnston, Joscha Prochno

TL;DR
This paper extends Faà di Bruno's formula to multivariate and non-commutative cases, providing combinatorial expressions for derivatives and power series inversion, with applications to polynomial invertibility and the Jacobian conjecture.
Contribution
It introduces a multivariate, combinatorial version of Faà di Bruno's formula and applies it to invertibility of power series and polynomial mappings, including a free non-commutative extension.
Findings
Derived a multivariate Faà di Bruno's formula using labelled trees.
Developed a new involution formula for multivariate power series inversion.
Extended the framework to non-commutative free power series.
Abstract
Fa\`a di Bruno's formula gives an expression for the derivatives of the composition of two real-valued functions. In this paper we prove a multivariate and synthesized version of Fa\`a di Bruno's formula in higher dimensions, providing a combinatorial expression for the derivatives of chain compositions of functions in terms of sums over labelled trees. We give several applications of this formula, including a new involution formula for the inversion of multivariate power series. We use this framework to outline a combinatorial approach to studying the invertibility of polynomial mappings, giving a purely combinatorial restatement of the Jacobian conjecture. Our methods extend naturally to the non-commutative case, where we prove a free version of Fa\`a di Bruno's formula for multivariate power series in free…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematical Dynamics and Fractals · Advanced Mathematical Identities
