Pattern avoidance in non-crossing and non-nesting permutations
Combinatorics
2025-05-12 v2
Abstract
Non-crossing and non-nesting permutations are variations of the well-known Stirling permutations. A permutation on is called non-crossing if it avoids the crossing patterns and is called non-nesting if it avoids the nesting patterns 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).
Cite
@article{arxiv.2502.13309,
title = {Pattern avoidance in non-crossing and non-nesting permutations},
author = {Kassie Archer and Robert P. Laudone},
journal= {arXiv preprint arXiv:2502.13309},
year = {2025}
}
Comments
10 pages, v2: corrected typo in Theorem 3.4