latin_tableaux
For a Young diagram μ, the set of Latin tableaux of shape μ and type μ' is the finset of fillings T from the cells of μ to natural numbers such that each entry in cell (i, j) is between 1 and the row length μ.rowLen i, and entries are distinct along each row and distinct along each column.
Statement
def latin_tableaux (μ : YoungDiagram) : Finset (μ.cells → ℕ)- Defined in
- scout/2610-29291-counting-and-constructing-latin-tableaux.md:450
- Verified
- 23 Oct 2026
- Axioms
- none listed
- Used by 13
- latin_double_three_tail_profile_baseEvery Latin tableau of shape (5,4,3,3) has the specified column profile.
- latin_double_three_tail_profile_allEvery Latin tableau in the double-3-tail staircase family has the three canonical column-symbol profiles (nine profiles before permuting…
- latin_double_three_tail_count_stepThe number of tableaux of the next shape is the sum of availability permanents over all tableaux of the previous shape.
- latin_tableaux_countThe number of Latin tableaux of shape $\mu$ and type $\mu'$, denoted $LT(\mu)$, is the cardinality of the finset of Latin tableaux of…
- latin_tableaux_count_mono_cell_addition_top_rowLet $d_1$ and $d_2$ be wide Young diagrams with the same number of rows $d_1.\text{colLen } 0 = d_2.\text{colLen } 0$. If…
- latin_tableaux_empty_cardThe number of Latin tableaux on the empty Young diagram is 1.
- latin_tableaux_count_mono_three_two_oneThe number of Latin tableaux of shape (3, 2, 1) is at most the number of Latin tableaux of shape (3, 3, 1), verifying Conjecture 6.1 for…
- latin_tableaux_shape5_first_three_colsIn every Latin tableau of shape (5,4,3,3), among the first three columns, exactly one column contains symbols {1,2,3,5} and the other two…
- latin_double_three_tail_profile_succInduction step for the double-3-tail staircase profile: for k >= 5, if every Latin tableau of shape (k,k-1,...,4,3,3) has the canonical…
- latin_double_three_tail_four_extensionsConjecture: every Latin tableau of shape (k,k-1,...,4,3,3), k at least 5, extends in exactly four ways after adding the next top row of…
- latin_double_three_tail_count_baseThere are exactly 144 Latin tableaux of shape (5,4,3,3).
- latin_double_three_tail_count_formulaThe open formula in arXiv:2610.29291 Conjecture 6.3: the number of Latin tableaux of shape (k,k-1,...,4,3,3) is 9 times 4 to the power k-3…
- latin_tableaux_shape5_tail_colsIn every Latin tableau of shape (5,4,3,3), column 4 contains a singleton {s} with s ∈ {1,2,3}, and column 3 contains {1,2,3} \ {s}.
Read back from the Lean
Given a Young diagram μ, latin_tableaux μ is defined as the finite set of fillings T : μ.cells → ℕ (functions from the cells of μ to the natural numbers) such that:
1. For every cell c = (r, c') ∈ μ.cells, the value T c is in the closed interval [1, μ.rowLen r], i.e., 1 ≤ T c ≤ μ.rowLen r.
2. For all cells c₁, c₂ ∈ μ.cells, if c₁ and c₂ have the same row index (c₁.1.1 = c₂.1.1) and T c₁ = T c₂, then they have the same column index (c₁.1.2 = c₂.1.2) (i.e., entries are strictly distinct along each row).
3. For all cells c₁, c₂ ∈ μ.cells, if c₁ and c₂ have the same column index (c₁.1.2 = c₂.1.2) and T c₁ = T c₂, then they have the same row index (c₁.1.1 = c₂.1.1) (i.e., entries are strictly distinct along each column).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The finset of Latin tableaux of shape μ and type μ': valid cell fillings by row-length bounded natural numbers with distinct entries along each row and column. -/ def latin_tableaux (μ : YoungDiagram) : Finset (μ.cells → ℕ) := (Fintype.piFinset fun c : μ.cells => Finset.Icc 1 (μ.rowLen c.1.1)).filter fun T => (∀ (c₁ c₂ : μ.cells), c₁.1.1 = c₂.1.1 → T c₁ = T c₂ → c₁.1.2 = c₂.1.2) ∧ (∀ (c₁ c₂ : μ.cells), c₁.1.2 = c₂.1.2 → T c₁ = T c₂ → c₁.1.1 = c₂.1.1)