Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

FishburnTenNineTreeCount

Abstract

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

Definition 1.1 (Definition descendants).

Lean statement: D5/S3/Combinatorics/Fishburn/FishburnTenNineTreeCount.descendants

Formalization. D5/S3/Combinatorics/Fishburn/FishburnTenNineTreeCount.descendants (✓ 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 abstract_tree_enumeration).

Lean statement: D5/S3/Combinatorics/Fishburn/FishburnTenNineTreeCount.abstract_tree_enumeration

Proof. Machine-checked in Lean as D5/S3/Combinatorics/Fishburn/FishburnTenNineTreeCount.abstract_tree_enumeration (✓ 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/FishburnTenNineTreeCount.abstract_tree_enumeration
  • Truth anchor: D5/S3/Combinatorics/Fishburn/FishburnTenNineTreeCount.descendants