2000 character limit reached
On the permutations that strongly avoid the pattern 312 or 231
Published 2 Apr 2024 in math.CO | (2404.01597v1)
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 $\pi$ which not only strongly avoid the pattern $312$ or $231$ but also avoid the pattern $\tau$, for $\tau\in S_3$ and some $\tau\in S_4$. One of them is to give a positive answer to a conjecture of Archer and Geary.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.