On a conjecture about pattern avoidance of cycle permutations
arXiv:2409.17482
Abstract
Let be a cycle permutation that can be expressed as one-line and a cycle form . Archer et al. introduced the notion of pattern avoidance of one-line and all cycle forms for a cycle permutation , defined as and its arbitrary cycle form avoid a given pattern. Let denote the set of cyclic permutations in the symmetric group that avoid in their one-line form and avoid in their all cycle forms. In this note, we prove that is the Pell number for any positive integer . Thereby, we give a positive answer to a conjecture of Archer et al.