On the permutations that strongly avoid the pattern 312 or 231
Combinatorics
2024-04-03 v1
Abstract
In 2019, B\'ona and Smith introduced the notion of \emph{strong pattern avoidance}, that is, a permutation and its square both avoid a given pattern. In this paper, we enumerate the set of permutations which not only strongly avoid the pattern or but also avoid the pattern , for and some . One of them is to give a positive answer to a conjecture of Archer and Geary.
Keywords
Cite
@article{arxiv.2404.01597,
title = {On the permutations that strongly avoid the pattern 312 or 231},
author = {Junyao Pan and Pengfei Guo},
journal= {arXiv preprint arXiv:2404.01597},
year = {2024}
}