Lattice word
= Lattice word
A word in positive integers is a <lattice word> if every initial segment has at least as many $i$'s as $(i+1)$'s for every $i$. This is the reading-word condition in the <Littlewood–Richardson rule>. Under <good-letter matching in a tableau word>, every letter of a <lattice word> is good.