Bounded affine permutations. II: Avoidance of decreasing patterns

DOI10.1007/S00026-021-00553-4zbMATH Open1479.05010arXiv2008.06406OpenAlexW3210088247MaRDI QIDQ825965FDOQ825965

Authors: Neal Madras, Justin M. Troyka 

Publication date: 18 December 2021

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: We continue our study of a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We focus on bounded affine permutations of size $N$ that avoid the monotone decreasing pattern of fixed size $m$. We prove that the number of such permutations is asymptotically equal to $(m-1{)}^{2N}{N}^{(m-2)/2}$ times an explicit constant as $Noinfty$. For instance, the number of bounded affine permutations of size $N$ that avoid $321$ is asymptotically equal to $4^N(N/4pi{)}^{1/2}$. We also prove a permuton-like result for the scaling limit of random permutations from this class, showing that the plot of a typical bounded affine permutation avoiding $mcdots1$ looks like $m-1$ random lines of slope $1$ whose $y$ intercepts sum to $0$.

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

Recommendations

• Bounded affine permutations. I: Pattern avoidance and enumeration
• Patterns in random permutations avoiding the pattern 132
• Enumerating pattern avoidance for affine permutations
• The shape of random pattern-avoiding permutations
• Large deviations and ratio limit theorems for pattern-avoiding permutations

zbMATH Keywords

asymptotic enumerationrandom measurepermutation patternaffine permutationpermuton

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Random measures (60G57) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cites Work

• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Limits of permutation sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability Inequalities for Sums of Bounded Random Variables
• Combinatorics of Coxeter Groups
• Title not available (Why is that?)
• Positroid varieties: juggling and geometry
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Asymptotic values for degrees associated with strips of Young diagrams
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Fixed points and excedances in restricted permutations
• Pattern characterization of rationally smooth affine Schubert varieties of type \(A\)
• Permutation classes
• Packing rates of measures and a conjecture for the packing density of 2413
• Finitely forcible graphons and permutons
• Title not available (Why is that?)
• Counting abelian squares
• Area of Catalan paths on a checkerboard
• The absence of a pattern and the occurrences of another
• Enumerating pattern avoidance for affine permutations
• Permutations with fixed pattern densities
• Large deviations for permutations avoiding monotone patterns
• Patterns in random permutations avoiding the pattern 321
• A decorated tree approach to random permutations in substitution-closed classes
• Universal limits of substitution-closed permutation classes
• Square permutations are typically rectangular
• Endless self-avoiding walks
• Patterns in random permutations avoiding the pattern 132
• Bounded affine permutations. II: Avoidance of decreasing patterns

Cited In (2)

• Bounded affine permutations. II: Avoidance of decreasing patterns
• Bounded affine permutations. I: Pattern avoidance and enumeration

This page was built for publication: Bounded affine permutations. II: Avoidance of decreasing patterns

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