latin_tableaux_count
def
The number of Latin tableaux of shape $\mu$ and type $\mu'$, denoted $LT(\mu)$, is the cardinality of the finset of Latin tableaux of shape $\mu$.
Statement
def latin_tableaux_count (μ : YoungDiagram) : ℕ- Defined in
- arXiv:2610.29291, Section 4
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Built on 1
- latin_tableauxFor 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…
- Used by 3
- 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_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…
Read back from the Lean
For a Young diagram μ, latin_tableaux_count μ is defined as the cardinality (number of elements) of latin_tableaux μ.
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 number of Latin tableaux of shape μ and type μ', denoted LT(μ). -/ def latin_tableaux_count (μ : YoungDiagram) : ℕ := (latin_tableaux μ).card