Combinatorics of Partial Derivatives
Michael Hardy
Abstract
The natural forms of the Leibniz rule for the kth derivative of a product and of Faà di Bruno's formula for the kth derivative of a composition involve the differential operator ∂k/∂ x1 ... ∂ xk rather than dk/dxk, with no assumptions about whether the variables x1,...,xk are all distinct, or all identical, or partitioned into several distinguishable classes of indistinguishable variables. Coefficients appearing in forms of these identities in which some variables are indistinguishable are just multiplicities of indistinguishable terms (in particular, if all variables are distinct then all coefficients are 1). The computation of the multiplicities in this generalization of Faà di Bruno's formula is a combinatorial enumeration problem that, although completely elementary, seems to have been neglected. We apply the results to cumulants of probability distributions.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.