Combinatorics of (m, n)-Word Lattices

We study the (m, n)-word lattices recently introduced by V. Pilaud and D. Poliakova in their study of generalized Hochschild polytopes. We prove that these lattices are extremal and constructable by interval doublings. Moreover, we describe further combinatorial properties of these lattices, such as their cardinality, their canonical join representations and their Galois graphs.