Some enumerative results related to ascent sequences
Authors:
- Toufik MansourTMToufik Mansour
- Mark ShattuckMSMark Shattuck
- 1 February 2014
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 315-316, 29-41
Abstract
No abstract availableAll Related Versions
This publication has 9 references indexed in Scilit:
- Enumerating -free posets by the number of minimal elements and other statisticsDiscrete Applied Mathematics, 2011
- Pattern Avoidance in Ascent SequencesThe Electronic Journal of Combinatorics, 2011
- Patterns in Permutations and Words2011
- -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
- On Pattern-Avoiding PartitionsThe Electronic Journal of Combinatorics, 2008
- Crossings and nestings of matchings and partitionsTransactions of the American Mathematical Society, 2006
- Generating functions for generating treesDiscrete Mathematics, 2002
- Enumeration Schemes and, more importantly, their automatic generationAnnals of Combinatorics, 1998