A simple proof of a theorem of Schmerl and Trotter for permutations

2014/09/16 by Brignall, Robert, Vatter, Vincent
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1409.4725

Abstract

When specialized to the context of permutations, Schmerl and Trotter's Theorem states that every simple permutation which is not a parallel alternation contains a simple permutation with one fewer entry. We give an elementary proof of this result.

Related

• A Survey of Simple Permutations
• Simple permutations poset
• Simple permutations: decidability and unavoidable substructures
• What Could Be a Simple Permutation?
• Pattern Avoiding Permutations Enumerated by Inversions