A simple proof of a theorem of Schmerl and Trotter for permutations
classification
🧮 math.CO
keywords
simplepermutationpermutationsproofschmerltheoremtrotteralternation
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.