Pattern avoidance in non-crossing and non-nesting permutations
Abstract
Non-crossing and non-nesting permutations are variations of the well-known Stirling permutations. A permutation π on \1,1,2,2,…, n,n\ is called non-crossing if it avoids the crossing patterns \1212,2121\ and is called non-nesting if it avoids the nesting patterns \1221,2112\. Pattern avoidance in these permutations has been considered in recent years, but it has remained open to enumerate the non-crossing and non-nesting permutations that avoid a single pattern of length 3. In this paper, we provide generating functions for those non-crossing and non-nesting permutations that avoid the pattern 231 (and, by symmetry, the patterns 132, 213, or 312).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.