A complete enumeration of Ballot permutations avoiding sets of small patterns

DOI10.54550/ECA2023V3S1R6MaRDI QIDQ6097070zbMATH OpenFDO

Authors Nathan Sun

Publication date 12 June 2023

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

ballot permutationsDyck pathspattern avoidancepermutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: Permutations whose prefixes contain at least as many ascents as descents are called ballot permutations. Lin, Wang, and Zhao have previously enumerated ballot permutations avoiding small patterns and have proposed the problem of enumerating ballot permutations avoiding a pair of permutations of length $3$. We completely enumerate ballot permutations avoiding two patterns of length $3$ and we relate these avoidance classes with their respective recurrence relations and formulas, which leads to an interesting bijection between ballot permutations avoiding $132$ and $312$ with left factors of Dyck paths. In addition, we also conclude the Wilf-classification of ballot permutations avoiding sets of two patterns of length $3$, and we then extend our results to completely enumerate ballot permutations avoiding three patterns of length $3$.

Recommendations

• A decomposition of ballot permutations, pattern avoidance and Gessel walks
• scientific article; zbMATH DE number 4168687
• Enumerating permutations avoiding three Babson-Steingrímsson patterns
• Two permutation classes enumerated by the central binomial coefficients
• The peak and descent statistics over ballot permutations

Cites work

• A bijection between well-labelled positive paths and matchings
• A decomposition of ballot permutations, pattern avoidance and Gessel walks
• Ballot permutations and odd order permutations
• Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope
• Major Index and Inversion Number of Permutations
• On permutation weights and \(q\)-Eulerian polynomials
• q-Bernoulli and Eulerian Numbers
• Restricted permutations

Cited in

(3)

• A decomposition of ballot permutations, pattern avoidance and Gessel walks
• scientific article; zbMATH DE number 4168687 (Why is no real title available?)
• A Toeplitz property of ballot permutations and odd order permutations

This page was built for publication: A complete enumeration of Ballot permutations avoiding sets of small patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097070)