Enumerating -free posets by the number of minimal elements and other statistics
Authors:
- Sergey KitaevSKSergey Kitaev
- Jeffrey RemmelJRJeffrey Remmel
- 1 October 2011
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 159 (17) , 2098-2108
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Icelandic Research Fund (090038011)
- NSF (0654060)
This publication has 9 references indexed in Scilit:
- -free posets, ascent sequences and pattern avoiding permutationsJournal of Combinatorial Theory, Series A, 2010
- Ascent Sequences and Upper Triangular Matrices Containing Non-Negative IntegersThe Electronic Journal of Combinatorics, 2010
- Height counting of unlabeled interval and N-free posetsDiscrete Mathematics, 2004
- Vassiliev invariants and a strange identity related to the Dedekind eta-functionTopology, 2001
- A Characterization of (3+1)-Free PosetsJournal of Combinatorial Theory, Series A, 2001
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTSJournal of Knot Theory and Its Ramifications, 1998
- Interval graphs and interval ordersDiscrete Mathematics, 1985
- Intransitive Indifference in Preference Theory: A SurveyOperations Research, 1970
- Intransitive indifference with unequal indifference intervalsJournal of Mathematical Psychology, 1970