Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 18 Nov 2019 in math.CO, math.CA, and math.PR | (1911.07458v5)

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 $F{(1)} \circ \ldots \circ F{(m)}$ of functions $F{(l)} : \mathbb{R}N \to \mathbb{R}N$ 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 indeterminates, and use this formula as a tool for obtaining a new inversion formula for free power series.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.