FishburnTenTwelveLastZero
Abstract
Mathematical definitions and results for Fishburn permutations and classical pattern avoidance.
Definition 1.1 (Definition endpoint).
Lean statement: D5/S3/Combinatorics/Fishburn/FishburnTenTwelveLastZero.endpoint
Formalization. D5/S3/Combinatorics/Fishburn/FishburnTenTwelveLastZero.endpoint (✓ std3).
Source. Repository-derived.
Acknowledgement. Eric S. Egge (2022). Pattern-Avoiding Fishburn Permutations and Ascent Sequences. DOI: 10.48550/arXiv.2208.01484. URL: https://arxiv.org/abs/2208.01484v1.
Commentary.
This definition specifies a mathematical object used in the Fishburn permutation construction.
Theorem 1.2 (Theorem last_zero_bijection).
Lean statement: D5/S3/Combinatorics/Fishburn/FishburnTenTwelveLastZero.last_zero_bijection
Proof. Machine-checked in Lean as D5/S3/Combinatorics/Fishburn/FishburnTenTwelveLastZero.last_zero_bijection (✓ std3). ∎
Source. Repository-derived.
Acknowledgement. Eric S. Egge (2022). Pattern-Avoiding Fishburn Permutations and Ascent Sequences. DOI: 10.48550/arXiv.2208.01484. URL: https://arxiv.org/abs/2208.01484v1.
Commentary.
This theorem establishes the stated mathematical relation for Fishburn permutations and classical pattern avoidance.
References
- Truth anchor:
D5/S3/Combinatorics/Fishburn/FishburnTenTwelveLastZero.endpoint - Truth anchor:
D5/S3/Combinatorics/Fishburn/FishburnTenTwelveLastZero.last_zero_bijection - Dependency: D5/S3/Combinatorics/Fishburn/FishburnBasicInitialValues
- Dependency: D5/S3/Combinatorics/Fishburn/FishburnTenTwelveCodes