Work

Combinatorics of $(m,n)$-Word Lattices

Year: 2024

Type: article

Abstract: 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.

Source: The Electronic Journal of Combinatorics

DOI: 10.37236/12906

Author: Henri Mühle

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4403096992

FWCI:

Cites:

Cited by:

Related to: 10