On the centrosymmetric permutations in a class

MaRDI QIDQ5197609zbMATH OpenFDO

Authors Justin M. Troyka

Publication date 19 September 2019

Full work available at URL https://arxiv.org/abs/1804.03686, http://ajc.maths.uq.edu.au/pdf/74/ajc_v74_p423.pdf

zbMATH Keywords

Bruhat ordergeometric grid classesinversion arrangementpattern avoidance

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Abstract: A permutation is centrosymmetric if it is fixed by a half-turn rotation of its diagram. Initially motivated by a question by Alexander Woo, we investigate the question of whether the growth rate of a permutation class equals the growth rate of its even-size centrosymmetric elements. We present various examples where the latter growth rate is strictly less, but we conjecture that the reverse inequality cannot occur. We conjecture that equality holds if the class is sum closed, and we prove this conjecture in the special case where the growth rate is at most $xiapprox2.30522$, using results from Pantone and Vatter on growth rates less than $xi$. We prove one direction of inequality for sum closed classes and for some geometric grid classes. We end with preliminary findings on new kinds of growth-rate thresholds that are a little bit larger than $xi$.

Recommendations

• PERMUTATION CLASSES OF EVERY GROWTH RATE ABOVE 2.48188
• Growth rates of permutation classes: from countable to uncountable
• Centrosymmetric permutations and involutions avoiding 1243 and 2143
• On growth rates of closed permutation classes
• Growth rates of geometric grid classes of permutations

Cites work

• Asymptotic values for degrees associated with strips of Young diagrams
• Classification of forbidden subsequences of length 4
• Counting 1324, 4231-avoiding permutations
• Enumerating \(r\)c-invariant permutations with no long decreasing subsequences
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Finding regular insertion encodings for permutation classes
• Finite transition matrices for permutations avoiding pairs of length four patterns
• Generating trees and forbidden subsequences
• Generating trees and the Catalan and Schröder numbers
• Geometric grid classes of permutations
• Growth rates of geometric grid classes of permutations
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Hultman elements for the hyperoctahedral groups
• On growth rates of closed permutation classes
• On the rearrangement conjecture for generalized factor order over \(\mathbb P\)
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Pattern-avoiding involutions: exact and asymptotic enumeration
• Permutation classes
• Permutations which are the union of an increasing and a decreasing subsequence
• Restricted permutations
• Restricted symmetric permutations
• Smoothness of Schubert varieties via patterns in root subsystems
• Some combinatorial aspects of reduced words in finite Coxeter groups
• Some combinatorial properties of Schubert polynomials
• Symmetric permutations avoiding two patterns
• The enumeration of three pattern classes using monotone grid classes
• The X-class and almost-increasing permutations
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

Cited in

(1)

• Hopping from Chebyshev polynomials to permutation statistics

Describes a project that uses

Uses Software

• InsEnc

This page was built for publication: On the centrosymmetric permutations in a class

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