An operator on ascent sequences
From MaRDI portal
Publication:5498511
DOI10.1007/s11859-014-1015-3zbMath1313.05024OpenAlexW2056081700MaRDI QIDQ5498511
Publication date: 11 February 2015
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-014-1015-3
Related Items (1)
Cites Work
- Unnamed Item
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Partitions and partial matchings avoiding neighbor patterns
- Composition matrices, \((2+2)\)-free posets and their specializations
- Pattern avoidance in ascent sequences
- Ascent sequences and upper triangular matrices containing non-negative integers
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- $n!$ matchings, $n!$ posets
- A direct encoding of Stoimenow's matchings as ascent sequences
- Restricted permutations
This page was built for publication: An operator on ascent sequences