Theorems · Inductive type · combinatorics

SemistandardYoungTableau

YoungDiagram → Type

A semistandard Young tableau is a filling of the cells of a Young diagram by natural numbers, such that the entries in each row are weakly increasing (left to right), and the entries in each column are strictly increasing (top to bottom). Here, a semistandard Young tableau is represented as an unrestricted function ℕ → ℕ → ℕ that, for reasons of extensionality, is required to vanish outside μ.

Defined in

Mathlib.Combinatorics.Young.SemistandardTableau

Cited by

17 results in Mathlib

Foundations

Depth 1 from the axioms · uses no axioms