加载中…
In 2019, Bóna 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本