Constructs explicit Sperner chain decompositions for L(3,n) and L(4,n) via chain tableaux, greedy algorithms, and recursive kneading.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux
Constructs explicit Sperner chain decompositions for L(3,n) and L(4,n) via chain tableaux, greedy algorithms, and recursive kneading.