Bounded affine permutations. I: Pattern avoidance and enumeration
From MaRDI portal
Abstract: We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show that if is one of the finite increasing oscillations, then every -avoiding affine permutation satisfies the boundedness condition. We also explore the enumeration of pattern-avoiding affine permutations that can be decomposed into blocks, using analytic methods to relate their exact and asymptotic enumeration to that of the underlying ordinary permutations. Finally, we perform exact and asymptotic enumeration of the set of all bounded affine permutations of size . A companion paper will focus on avoidance of monotone decreasing patterns in bounded affine permutations.
Recommendations
- Bounded affine permutations. II: Avoidance of decreasing patterns
- Enumerating pattern avoidance for affine permutations
- Extended abstract for enumerating pattern avoidance for affine permutations
- Rational generating series for affine permutation pattern avoidance
- 321-avoiding affine permutations and their many heaps
Cites work
- A Combinatorial Lemma and Its Application to Probability Theory
- A problem of arrangements
- Analytic combinatorics
- Basic analytic combinatorics of directed lattice paths
- Bounded affine permutations. II: Avoidance of decreasing patterns
- Central and local limit theorems applied to asymptotic enumeration
- Combinatorics of Coxeter Groups
- Endless self-avoiding walks
- Enumerating pattern avoidance for affine permutations
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Finitely forcible graphons and permutons
- Functional Composition Patterns and Power Series Reversion
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3538576 (Why is no real title available?)
- scientific article; zbMATH DE number 201032 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3386710 (Why is no real title available?)
- Large infinite antichains of permutations
- On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
- Pattern characterization of rationally smooth affine Schubert varieties of type \(A\)
- Permutation classes
- Positroid varieties: juggling and geometry
- Small permutation classes
- Supercritical sequences, and the nonrationality of most principal permutation classes
- The cycle lemma and some applications
Cited in
(7)- 321-avoiding affine permutations and their many heaps
- Enumerating pattern avoidance for affine permutations
- Algebraic and affine pattern avoidance
- Extended abstract for enumerating pattern avoidance for affine permutations
- Arc permutations (extended abstract)
- Enumerating anchored permutations with bounded gaps
- Bounded affine permutations. II: Avoidance of decreasing patterns
This page was built for publication: Bounded affine permutations. I: Pattern avoidance and enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074763)
