Permutations avoiding sets of patterns with long monotone subsequences
Abstract
We enumerate permutations that avoid all but one of the k patterns of length k starting with a monotone increasing subsequence of length k-1. We compare the size of such permutation classes to the size of the class of permutations avoiding the monotone increasing subsequence of length k-1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.