The number of elements in a generalized partition semilattice
From MaRDI portal
Publication:1584273
DOI10.1016/S0012-365X(97)00187-8zbMath0956.52009OpenAlexW2082973394MaRDI QIDQ1584273
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00187-8
Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)
Related Items (4)
Bijections for faces of the Shi and Catalan arrangements ⋮ Enumeration of Flats of the Extended Catalan and Shi Arrangements with Species ⋮ Skew metrics valued in Sugihara semigroups ⋮ Supersolvable frame-matroid and graphic-lift lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Une théorie combinatoire des séries formelles
- A basis for the top homology of a generalized partition lattice
- Characteristic polynomials of subspace arrangements and finite fields
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Hyperplane arrangements, interval orders, and trees.
This page was built for publication: The number of elements in a generalized partition semilattice