Papers
Topics
Authors
Recent
Search
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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.