Characterizing avoidance in cycles via vincular patterns
In this paper, the author shows that cyclic permutations avoiding 321 are precisely those permutations whose image under the fundamental bijection avoids a set of vincular patterns. This is realized using pattern functions and arrow patterns, in combination with the characterization of 321 avoidance in terms of equality of the upper bound of the Daiconis-Graham inequalities [\textit{P. Diaconis} and \textit{R. L. Graham}, J. R. Stat. Soc., Ser. B 39, 262--268 (1977; Zbl 0375.62045)]. Some consequences of this result are explored, including upper and lower bound results on the growth rate of 321 avoiding cycles. Four open questions conclude the paper.
- An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations
- Cyclic permutations realized by signed shifts
- Exact and asymptotic enumeration of cyclic permutations according to descent set
- scientific article; zbMATH DE number 3584785 (Why is no real title available?)
- scientific article; zbMATH DE number 964350 (Why is no real title available?)
- Pattern-functions, statistics, and shallow permutations
- Pattern-restricted one-cycle permutations with a pattern-restricted cycle form
- Simple permutations and pattern restricted permutations
This page was built for publication: Characterizing avoidance in cycles via vincular patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866275)
