Bounded affine permutations I. Pattern avoidance and enumeration
From MaRDI portal
Publication:5074763
zbMath1493.05008arXiv2003.00267MaRDI QIDQ5074763
Publication date: 10 May 2022
Full work available at URL: https://arxiv.org/abs/2003.00267
Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finitely forcible graphons and permutons
- Excluded permutation matrices and the Stanley-Wilf conjecture
- The cycle lemma and some applications
- Bounded affine permutations. II: Avoidance of decreasing patterns
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- Basic analytic combinatorics of directed lattice paths
- Pattern characterization of rationally smooth affine Schubert varieties of type \(A\)
- Enumerating pattern avoidance for affine permutations
- Supercritical sequences, and the nonrationality of most principal permutation classes
- Central and local limit theorems applied to asymptotic enumeration
- A problem of arrangements
- Endless self-avoiding walks
- Positroid varieties: juggling and geometry
- Large infinite antichains of permutations
- Permutation classes
- Combinatorics of Coxeter Groups
- Small permutation classes
- A Combinatorial Lemma and Its Application to Probability Theory
- Functional Composition Patterns and Power Series Reversion
This page was built for publication: Bounded affine permutations I. Pattern avoidance and enumeration