Rigidity, Descents, and Wilf Classification in Pattern-Avoiding Canon Permutations

Abstract

This focused preprint proves four conjectures on pattern avoidance in canon permutations, gives all twelve fixed-alphabet counting formulas for the 64 subsets of three-letter patterns, classifies those subsets into exactly 21 global canon-Wilf classes, and develops descent and alternating-orbit enumerations. It is the combinatorial component of a reorganization of the original unified preprint (10.5281/zenodo.22088094). The expanded repeated-endpoint cone-walk, harmonic, and spectral component is now published separately as 10.5281/zenodo.22091634. A Lean 4 formalization of the principal results is in progress.