Crab Research
Return to results
Combinatorics

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

Working Paper · ZenodoFirst public

Overview

Rigidity, descent formulas, and global Wilf classification for canon permutations. The current public manuscript predates the completed formal package.

Original public questions

Laudone’s canon permutation conjectures: 6.1, 6.2, 6.3 and 6.6

Robert Laudone: Pattern avoidance in canon permutations — Conjectures 6.1, 6.2, 6.3 and 6.6, Question 6.5, and the unnumbered alternating-family question in Section 5.

Original abstract (English)

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.

Public abstract source

MathematicsCombinatoricscanon permutationspattern avoidanceCatalan numberscanon-Wilf equivalencedescent polynomialsDavenport-Schinzel sequences

Mathematical review

Paper Close

Paper Close marks a working paper prepared and internally reviewed before release. Please treat it as an ordinary scholarly preprint: further checking or discussion may lead to corrections. It does not indicate complete formal verification or external peer review.

Review standard
Return to results
Back to Mathematics