A Brylawski decomposition for finite ordered sets

DOI10.1016/0012-365X(73)90117-9zbMath0256.06001OpenAlexW2145778898MaRDI QIDQ2558873

Richard P. Stanley

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90117-9

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15)

Related Items (11)

On the computational complexity of the order polynomial ⋮ Doppelgangers: the ur-operation and posets of bounded height (extended abstract) ⋮ Representation functions and the Neggers-Stanley condition for weight-shaped-posets ⋮ The Redei function of a relation ⋮ The Tutte-Grothendieck group of an alphabetic rewriting system ⋮ Set maps, umbral calculus, and the chromatic polynomial ⋮ Combinatorial reciprocity theorems ⋮ Acyclic orientations of graphs. (Reprint) ⋮ Binomial Enumeration on Dissects ⋮ Acyclic orientations of graphs ⋮ The Tutte-Grothendieck ring

Cites Work

• The Tutte-Grothendieck ring
• A Decomposition for Combinatorial Geometries
• Ordered structures and partitions
• Unnamed Item
• Unnamed Item

This page was built for publication: A Brylawski decomposition for finite ordered sets