Pattern Avoidance in Permutations and Their Rotations

Publication Date

7-22-2026

Document Type

Paper

Organizational Units

College of Natural Science and Mathematics, Mathematics

Keywords

Pattern avoidance, Permutations, Rotations, Wilf-equivalence, Enumeration

Abstract

A rotation of a permutation is a new permutation obtained by moving the first several terms of the permutation to the end of the permutation. A circular permutation is the set of all rotations of a permutation. The enumerations of permutations and circular permutations avoiding patterns of length three and four are well studied. In this paper, we provide exact formulas for the number of permutations whose first k ≥ 2 rotations all avoid a given pattern of length three, as well as the number of permutations whose first three rotations respectively avoid the rotations of a given pattern of length three. In contrast to permutations and circular permutations avoiding patterns of length three, the Wilf-equivalence classes under study are entirely determined by complements and reverses. We also classify and enumerate permutations whose first two rotations avoid different patterns of length three.

Copyright Date

7-22-2026

Copyright Statement / License for Reuse

All Rights Reserved
All Rights Reserved.

Rights Holder

The Authors

Provenance

Received from author

Language

English (eng)

Extent

20 pgs

Publication Statement

Copyright is held by the authors. User is responsible for all copyright compliance.

This is a preprint of a paper that has been submitted for publication.



Share

COinS