Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Real-rooted coefficient permutations

Abstract

Coefficient orders of products of positive linear factors.

Definition 1.1 (Coefficient sequence).

Lean statement: D5/S3/Combinatorics/RealRootedPermutations/Defs.coeffs

Formalization. D5/S3/Combinatorics/RealRootedPermutations/Defs.coeffs (✓ std3).

Source. Repository-derived.

Commentary.

For a finite family of real parameters, coeffs r k is the coefficient of X^k in the product of the factors 1 + r i X.

Definition 1.2 (Unimodal permutation).

Lean statement: D5/S3/Combinatorics/RealRootedPermutations/Defs.IsUnimodal

Formalization. D5/S3/Combinatorics/RealRootedPermutations/Defs.IsUnimodal (✓ std3).

Source. Repository-derived.

Acknowledgement. T. Ball, D. Galvin, C. Hyry, and K. Weingartner (2022). Independent set and matching permutations. DOI: 10.1002/jgt.22724. URL: https://doi.org/10.1002/jgt.22724.

Commentary.

The inverse positions increase through the value at the final position and decrease after that value.

Definition 1.3 (Weak coefficient ordering).

Lean statement: D5/S3/Combinatorics/RealRootedPermutations/Defs.Arises

Formalization. D5/S3/Combinatorics/RealRootedPermutations/Defs.Arises (✓ std3).

Source. Repository-derived.

Acknowledgement. T. Ball, D. Galvin, C. Hyry, and K. Weingartner (2022). Independent set and matching permutations. DOI: 10.1002/jgt.22724. URL: https://doi.org/10.1002/jgt.22724.

Commentary.

Arises records a positive parameter family whose nonconstant coefficients are weakly increasing in the order specified by the permutation.

Definition 1.4 (Question 4.6 formal statement).

Lean statement: D5/S3/Combinatorics/RealRootedPermutations/Defs.claim

Formalization. D5/S3/Combinatorics/RealRootedPermutations/Defs.claim (✓ std3).

Source. Repository-derived.

Acknowledgement. T. Ball, D. Galvin, C. Hyry, and K. Weingartner (2022). Independent set and matching permutations. DOI: 10.1002/jgt.22724. URL: https://doi.org/10.1002/jgt.22724.

Commentary.

The claim states that, for every finite size and permutation, weakly sortable coefficient orders are exactly the unimodal permutations.

References