Pattern avoidance in ascent sequences
From MaRDI portal
Publication:665745
zbMath1243.05010arXiv1109.3641MaRDI QIDQ665745
Einar Steingrímsson, Paul Duncan
Publication date: 6 March 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.3641
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)
Related Items (21)
Restricted growth function patterns and statistics ⋮ Some enumerative results related to ascent sequences ⋮ Inversion sequences avoiding pairs of patterns ⋮ Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers ⋮ Dynamical aspects of \(\sigma\)-machines ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Ascent sequences and 3-nonnesting set partitions ⋮ On \(\underline{12} 0\)-avoiding inversion and ascent sequences ⋮ Catalan pairs and Fishburn triples ⋮ Catalan words avoiding pairs of length three patterns ⋮ Restricted inversion sequences and enhanced 3-noncrossing partitions ⋮ Ascent sequences avoiding pairs of patterns ⋮ 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 ⋮ Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations ⋮ Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations ⋮ An operator on ascent sequences ⋮ Pattern-avoiding ascent sequences of length 3 ⋮ Transport of patterns by Burge transpose ⋮ Weak ascent sequences and related combinatorial structures
This page was built for publication: Pattern avoidance in ascent sequences
