Binomial Enumeration on Dissects

DOI10.2307/1997294zbMath0303.05013OpenAlexW4236774397MaRDI QIDQ4058969

Michael G. Henle

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/1997294

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) General theory of ordinary differential operators (47E05) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Une combinatoire du pléthysme. (Combinatorics of plethysm), Operatorenkalkül über freien Monoiden II: Binomialsysteme, Sistemi di coefficienti sezionali. I, Sistemi di coefficienti sezionali. II, Gončarov polynomials in partition lattices and exponential families, The umbral calculus, Coalgebras and Bialgebras in Combinatorics, Umbral Calculus, Binomial Enumeration and Chromatic Polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Brylawski decomposition for finite ordered sets
• On the foundations of combinatorial theory. VIII: Finite operator calculus
• The Characters of the Finite General Linear Groups
• An exposá of the mullin-rota theory of polynomials of binomial type
• On the Foundations of Combinatorial Theory. VII: Symmetric Functions through the Theory of Distribution and Occupancy
• The Use of S-Functions in Combinatorial Analysis
• A Decomposition for Combinatorial Geometries
• Theory and Application of Plane Partitions: Part 1
• On the Foundations of Combinatorial Theory V, Eulerian Differential Operators
• Ordered structures and partitions
• Dissection of Generating Functions
• Differential Operators Associated with S -Functions