The subposet lattice and the order polynomial

DOI10.1016/S0195-6698(82)80018-8zbMath0504.06004OpenAlexW2094210094MaRDI QIDQ1835689

Paul Klingsberg, Paul H. Edelman

Publication date: 1982

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(82)80018-8

zbMATH Keywords

antichainfinite posetnumber of connected componentslengthorder polynomialMoebius inversionantiexchange closurelattice of subposetsmeet-distributive latticenumber of order preserving functions

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (4)

Excluded-minor characterizations of antimatroids arisen from posets and graph searches. ⋮ The lattice of convex sets of an oriented matroid ⋮ Toric partial orders ⋮ A use for frequently rediscovering a concept

Cites Work

• Meet-distributive lattices and the anti-exchange closure
• The lattice of convex sets of an oriented matroid
• Natural Partial Orders
• Ordered structures and partitions
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Combinatorial reciprocity theorems

This page was built for publication: The subposet lattice and the order polynomial