Ascent sequences and 3-nonnesting set partitions
From MaRDI portal
Publication:2441950
DOI10.1016/j.ejc.2013.12.007zbMath1284.05035arXiv1208.1915OpenAlexW2065068140MaRDI QIDQ2441950
Publication date: 31 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.1915
Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items
On some combinatorial sequences associated to invariant theory ⋮ Some enumerative results related to ascent sequences ⋮ Inversion sequences avoiding pairs of patterns ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Restricted inversion sequences and enhanced 3-noncrossing partitions ⋮ Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions ⋮ Patterns of relation triples in inversion and ascent sequences ⋮ Vincular patterns in inversion sequences ⋮ Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations ⋮ A combinatorial bijection on \(k\)-noncrossing partitions
Uses Software
Cites Work
- Unnamed Item
- Some enumerative results related to ascent sequences
- Pattern avoidance in ascent sequences
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Ascent sequences and upper triangular matrices containing non-negative integers
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Spin-preserving Knuth correspondences for ribbon tableaux
- On 021-avoiding ascent sequences
- Crossings and nestings of matchings and partitions
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
This page was built for publication: Ascent sequences and 3-nonnesting set partitions
