A bijection for length-5 patterns in permutations

DOI10.1016/j.jcta.2023.105815arXiv2211.06871MaRDI QIDQ6144383

Zhicong Lin, Joanna N. Chen

Publication date: 29 January 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.06871

zbMATH Keywords

pattern avoidancebijectionsinverse descentsleft-to-right maximum

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (1)

Further refinements of Wilf-equivalence for patterns of length 4

Cites Work

• A permutation code preserving a double Eulerian bistatistic
• Patterns in permutations and words.
• A sextuple equidistribution arising in pattern avoidance
• Real-rootedness of variations of Eulerian polynomials
• Combinatorics of the symmetries of ascents in restricted inversion sequences
• Block decomposition and statistics arising from permutation tableaux
• Patterns of relation triples in inversion and ascent sequences
• On partially ordered patterns of length 4 and 5 in permutations
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
• A refinement of Wilf-equivalence for patterns of length 4
• The insertion encoding of permutations
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Consecutive patterns in inversion sequences II: avoiding patterns of relations
• Simple marked mesh patterns
• The 𝐬-Eulerian polynomials have only real roots

This page was built for publication: A bijection for length-5 patterns in permutations