On permutations avoiding the dashed patterns 32-41 and 41-32
Abstract
We show that permutations of size n avoiding both of the dashed patterns 32-41 and 41-32 are equinumerous with indecomposable set partitions of size n+1, and deduce a related result.
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.