latin_top_row_availability
def
The zero-one matrix whose row index is a prospective symbol minus one and whose column index is a column: an entry is one precisely when inserting that symbol above T creates no column conflict.
Statement
def latin_top_row_availability (d : YoungDiagram) (T : d.cells → ℕ) (w : ℕ) :
Matrix (Fin w) (Fin w) ℕ- Source
- Helper for the open enumeration problem in https://arxiv.org/html/2610.29291v1, Conjecture 6.3, using the availability-permanent identity of Lemma 5.4. Exact computational route: experiments 4100, 4103 and 4106.
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Used by 5
- 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_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_permanent_of_profileA filling with the canonical column profile has exactly four legal permutations for a new top row of length k+1.
- 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_top_row_availability_eq_one_iffThe availability entry equals one exactly when the prospective positive symbol does not already occur in that column.
Lean source view module on GitHub
def latin_top_row_availability (d : YoungDiagram) (T : d.cells → ℕ) (w : ℕ) : Matrix (Fin w) (Fin w) ℕ := fun i j => if ∀ c : d.cells, c.val.2 = j.val → T c ≠ i.val + 1 then 1 else 0