Related papers: Combinatorial differential operators in: Fa\`a di …
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…
The natural forms of the Leibniz rule for the $k$th derivative of a product and of Fa\`a di Bruno's formula for the $k$th derivative of a composition involve the differential operator $\partial^k/\partial x_1 ... \partial x_k$ rather than…
We give yet another proof for Fa\`{a} di Bruno's formula for higher derivatives of composite functions. Our proof technique relies on reinterpreting the composition of two power series as the generating function for weighted integer…
This paper determines the general formula for describing differentials of composite functions in terms of differentials of their factor functions. This generalises the formula commonly attributed to Faa di Bruno to functions in locally…
How do we take repeated derivatives of composed multivariate functions? for one-dimensional functions, the common tools consist of the Fa\'a di Bruno formula with Bell polynomials; while there are extensions of the Fa\'a di Bruno formula,…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
We give a one-sentence elementary proof of the combinatorial Fa\`a di Bruno's formula.
Using the lattice paths in $\mathbb{N}\times\mathbb{N}$, we derive a general formula for sequences $\big(T(n,k)\big)$ satisfying the recurrence relation of the form: \begin{equation*} T((n,k)=a_{n,k}T(n-1,k)+b_{n,k}T(n-1,k-1).…
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
We derive some formulas that rule the behaviour of finite differences under composition of functions with vector values and arguments.
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
High-order derivatives of nested functions of a single variable can be computed with the celebrated Fa\`a di Bruno's formula. Although generalizations of such formula to multiple variables exist, their combinatorial nature generates an…
We provide a novel representation of the total n-th derivative of the multivariate composite function $f \circ g$, i.e. a generalized Fa\`a di Bruno's formula. To this end, we make use of properties of the Kronecker product and the n-th…
In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…
We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
The functional equation defining the free cumulants in free probability is lifted successively to the noncommutative Fa\`a di Bruno algebra, and then to the group of a free operad over Schr\"oder trees. This leads to new combinatorial…
We consider weighted generating functions of trees where the weights are products of functions of the sizes of the subtrees. This work begins with the observation that three different communities, largely independently, found substantially…