The enumeration of permutations avoiding 2143 and 4231

MaRDI QIDQ2915616zbMATH OpenFDO

Authors Mike Atkinson, Robert Brignall, Michael Albert

Publication date 18 September 2012

Published in PU.M.A. Pure Mathematics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

enumerationpattern avoidancepermutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Abstract: We enumerate the pattern class Av(2143,4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes.

Cited in

(9)

• Universal limits of substitution-closed permutation classes
• Counting 1324, 4231-avoiding permutations
• Enumerating indices of Schubert varieties defined by inclusions
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius
• An algorithm computing combinatorial specifications of permutation classes
• Juxtaposing Catalan permutation classes with monotone ones
• Patterns in random permutations avoiding the pattern 132
• Grid classes and partial well order
• Combinatorial exploration: an algorithmic framework for enumeration

This page was built for publication: The enumeration of permutations avoiding 2143 and 4231

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