On a conjecture about enumerating \((2+2)\)-free posets
From MaRDI portal
Publication:616386
DOI10.1016/J.EJC.2010.10.010zbMath1206.06001arXiv1006.1226OpenAlexW2131203714WikidataQ122918573 ScholiaQ122918573MaRDI QIDQ616386
Publication date: 7 January 2011
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.1226
Related Items (9)
Fishburn trees ⋮ On \(q\)-series identities related to interval orders ⋮ Decomposing labeled interval orders as pairs of permutations ⋮ Counting general and self-dual interval orders ⋮ Asymptotics and statistics on Fishburn matrices and their generalizations ⋮ Equidistributed statistics on Fishburn matrices and permutations ⋮ Catalan pairs and Fishburn triples ⋮ A new decomposition of ascent sequences and Euler-Stirling statistics ⋮ Asymptotics for the number of row-Fishburn matrices
Cites Work
- Unnamed Item
- Unnamed Item
- An obvious proof of Fishburn's interval order theorem
- Ascent sequences and upper triangular matrices containing non-negative integers
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Height counting of unlabeled interval and \(N\)-free posets.
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
This page was built for publication: On a conjecture about enumerating \((2+2)\)-free posets