Cluster k0008
Counting words and tableaux, coefficient bounds for symmetric polynomials
Files about combinatorial counting tied to polynomials. A "lattice word" is a list of row labels in which, at every point, earlier rows have been used at least as often as later rows. Sample statements say a standard Young tableau (boxes filled with increasing numbers) gives such a word, that each row has the expected number of boxes, and that a coefficient is bounded by the number of lattice words. One identity says a determinant of descending-factorial entries equals the Vandermonde product. This is bookkeeping that turns polynomial coefficients into counts. Most files prove a stated claim from smaller ones.
6 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Finite sets and countingPermutations, sign and inversionsSymmetric polynomials and elementary symmetric functionsLinear algebra
References
Fulton, Young Tableaux · ch. 4-6Background reading suggested by the AI namer · unchecked
Uses
Used by
36 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.RemainderTerms.