FishburnBasicPatternTransport

Abstract

Mathematical definitions and results for Fishburn permutations and classical pattern avoidance.

Theorem 1.1 (Theorem maximum_pattern_transport).

Lean statement: D5/S3/Combinatorics/Fishburn/FishburnBasicPatternTransport.maximum_pattern_transport

Proof. Machine-checked in Lean as D5/S3/Combinatorics/Fishburn/FishburnBasicPatternTransport.maximum_pattern_transport (✓ 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/FishburnBasicPatternTransport.maximum_pattern_transport
• Dependency: D5/S3/Combinatorics/Fishburn/FishburnBasicPatterns