Rational generating series for affine permutation pattern avoidance
From MaRDI portal
Publication:5963386
Abstract: We consider the set of affine permutations that avoid a fixed permutation pattern. Crites has given a simple characterization for when this set is infinite. We find the generating series for this set using the Coxeter length statistic and prove that it can always be represented as a rational function. We also give a characterization of the patterns for which the coefficients of the generating series are periodic. The proofs exploit a new polyhedral encoding for the affine symmetric group.
Recommendations
- Enumerating pattern avoidance for affine permutations
- Generating functions for permutations avoiding a consecutive pattern
- Pattern avoidance of generalized permutations
- Extended abstract for enumerating pattern avoidance for affine permutations
- Generating functions for descents over permutations which avoid sets of consecutive patterns
- Pattern-avoiding permutation powers
- Pattern avoidance for random permutations
- Asymptotic enumeration of permutations avoiding generalized patterns
- On permutations avoiding arithmetic progressions
- Permutations of rational residues
Cited in
(6)- Rationality for subclasses of 321-avoiding permutations
- 321-avoiding affine permutations, heaps, and periodic parallelogram polyominoes
- Enumerating pattern avoidance for affine permutations
- Avoiding maximal parabolic subgroups of \(S_k\)
- Supercritical sequences, and the nonrationality of most principal permutation classes
- Bounded affine permutations. I: Pattern avoidance and enumeration
This page was built for publication: Rational generating series for affine permutation pattern avoidance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963386)
