On Whitney numbers of the order ideals of generalized fences and crowns
From MaRDI portal
Publication:1011689
DOI10.1016/j.disc.2007.12.077zbMath1159.06004arXivmath/0505636MaRDI QIDQ1011689
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0505636
05A15: Exact enumeration problems, generating functions
06A07: Combinatorics of partially ordered sets
Related Items
Catalan pairs: a relational-theoretic approach to Catalan numbers, Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm to generate the ideals of a partial order
- On estimating the number of order ideals in partial orders, with some applications
- A permutation group determined by an ordered set
- On the rank polynomial of the lattice of order ideals of fences and crowns
- HYP and HYPQ
- Chromatic polynomials and logarithmic concavity
- Solution of Two Difficult Combinatorial Problems with Linear Algebra
- Logarithmic concavity and \({\mathfrak {sl}}_2({\mathbf C})\)