The theory of compositionals
From MaRDI portal
Publication:1313850
DOI10.1016/0012-365X(93)90287-4zbMath0798.05075MaRDI QIDQ1313850
Publication date: 20 October 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
plethysmformal power seriesPólya's theorempartition latticedelta seriescompositionalscycle indicesplethystic Hopf algebraplethystic inverseplethystic latticeplethystic Schröder treesplethystic trees
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Categorical aspects of generating functions. I: Exponential formulas and Krull-Schmidt categories ⋮ Baxter algebras and the umbral calculus ⋮ Compositional calculus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colored species, \(c\)-monoids, and plethysm. I
- A general umbral calculus in infinitely many variables
- Witt vectors and the algebra of necklaces
- On formal power series defined by infinite linear systems
- Antipodes and incidence coalgebras
- Plethysm, categories and combinatorics
- Une combinatoire du pléthysme. (Combinatorics of plethysm)
- On the combinatorics of plethysm
- The relation between Burnside rings and combinatorial species
- Categories de Möbius et fonctorialites: un cadre général pour l'inversion de Möbius
- A cycle index sum inversion theorem
- The fixed-point partition lattices
- Recognizable formal power series on trees
- The isomorphism problem for incidence algebras of Möbius categories
- Une théorie combinatoire des séries formelles
- Some aspects of groups acting on finite posets
- Möbius species
- Incidence algebra antipodes and Lagrange inversion in one and several variables
- Lagrange inversion for species
- The fundamental theorem of voting schemes
- The Enumeration of Locally Restricted Graphs (I)
- A general bijective algorithm for trees.
- Coalgebras and Bialgebras in Combinatorics
- Exponential Structures
- On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
- Enumeration of non-separable graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: The theory of compositionals