Umbral Calculus, Binomial Enumeration and Chromatic Polynomials
If \(\alpha =(\alpha_ i)\) is an umbral (sequence) in the special ring A, then the operator \(e^{\alpha D}-1\), where \(D=\frac{d}{dx}\), has a conjugate operator \(e^{{\bar \alpha}D}-1\) where \({\bar \alpha}{}_{i- 1}=<(\Delta | D)^{-i}x^{i-1}>\), according to the Lagrange inversion principle. This situation along with other well-chosen examples is one of several special cases of Moebius inversion as developed in this very interesting paper which promises more to come as well. Included among the examples in addition to the author's version of the umbral calculus are a setting for binomial enumeration and a generalization (the bond polynomial) of the chromatic polynomial of a graph. The context is that of the theory of incidence algebras for partition categories P over rings A. Here P is a subcategory of the path-category P(E) generated over the partition poset (graph) whose arrows (\(\pi\),\(\sigma)\) or \(\pi\) \(\to \sigma\) are generated by refinements (\(\pi\leq \sigma).\) If \(F^+\phi\) is a free commutative monoid and A (usually Z[\(\phi\) ]) is a commutative (graded) ring with 1, then (multiplicative) t: P(E)\(\to F^+\phi\) (type), (multiplicative) \({\hat \omega}\): \(F^+\phi \to A\) (classifying map) and \(\omega =t\circ {\hat \omega}\) (weight) constructs P(E) over A. If \(A=Z[\phi]\), \(t=\zeta^{\phi}\) is the zeta-function for P(E). RP consists of all multiplicative functions \(\alpha\) : \(P\to R\), \(R=A\) yields an incidence algebra, \(R=A=Z[\phi]\) yields the type algebra. In this setting the (convolution)-inverses of \(\zeta^{\phi}\) and w are \(\mu^{\phi}\) and \(\mu\), the Moebius type-function and the Moebius weight-function respectively. It is this pair of observations which provides the tools needed in the examples to obtain the very useful conclusions arrived at.
- A local method in group cohomology
- Binomial Enumeration on Dissects
- Categories de Möbius et fonctorialites: un cadre général pour l'inversion de Möbius
- Categories for the working mathematician
- Coalgebras and Bialgebras in Combinatorics
- Combinatorial theory
- Extensions of umbral calculus: Penumbral coalgebras and generalized Bernoulli numbers
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3851501 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3409479 (Why is no real title available?)
- On the foundations of combinatorial theory. I: Theory of Möbius functions
- Plethysm, categories and combinatorics
- Principles of combinatorics
- Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
- Une théorie combinatoire des séries formelles
- Umbral interpolation and the addition/contraction tree for graphs
- Symmetric functions, formal group laws, and Lazard's theorem
- A bibliography on chromatic polynomials
- Gončarov polynomials in partition lattices and exponential families
- Laurent sequences, extended Rota algebras and categorical discretization of dynamical systems
- Set maps, umbral calculus, and the chromatic polynomial
This page was built for publication: Umbral Calculus, Binomial Enumeration and Chromatic Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818320)