Characterising inflations of monotone grid classes of permutations

2017/02/14 by Michael Albert, Albert, Michael, Aistis Atminas +3
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #graph theory and CDMA systems #Advanced Combinatorial Mathematics

paper · pdf · doi:10.48550/arxiv.1702.04269

Abstract

We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing a long sum of 21s.

Citations

• Simple permutations and pattern restricted permutations

Related

• Inflations of Geometric Grid Classes: Three Case Studies
• On cycles in monotone grid classes of permutations
• The Enumeration of Permutations Avoiding 3124 and 4312
• Inflations of geometric grid classes of permutations
• Grid classes and the Fibonacci dichotomy for restricted permutations