Rational generating series for affine permutation pattern avoidance
From MaRDI portal
Publication:5963386
DOI10.4310/JOC.2016.V7.N1.A3zbMATH Open1330.05005arXiv1501.03087OpenAlexW2964233722MaRDI QIDQ5963386FDOQ5963386
Authors: Brant C. Jones 
Publication date: 19 February 2016
Published in: Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1501.03087
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
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Symmetric groups (20B30)
Cited In (2)
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)
