A poset is called upper homogeneous, or “upho,” if all of its principal order filters are isomorphic to the whole poset. In previous work of the first author, it was shown that each (finite-type $\mathbb{N}$-graded) upho lattice has associated to it a finite graded lattice, called its core, which determines the rank generating function of the upho lattice. In that prior work the question of which finite graded lattices arise as cores was explored. Here, we study the question of in how many different ways a given finite graded lattice can be realized as the core of an upho lattice. We show that if the finite lattice has no nontrivial automorphisms, then it is the core of finitely many upho lattices. We also show that the number of ways a finite lattice can be realized as a core is unbounded, even when restricting to rank-two lattices. We end with a discussion of a potential algorithm for listing all the ways to realize a given finite lattice as a core.
Revised:
Accepted:
Published online:
Keywords: upho posets, lattices, monoids, cancellativity, automorphisms
CC-BY 4.0
Hopkins, Sam; Lewis, Joel B. Upho lattices II: ways of realizing a core. Algebraic Combinatorics, Volume 9 (2026) no. 2, pp. 557-575. doi: 10.5802/alco.486
@article{ALCO_2026__9_2_557_0,
author = {Hopkins, Sam and Lewis, Joel B.},
title = {Upho lattices {II:} ways of realizing a core},
journal = {Algebraic Combinatorics},
pages = {557--575},
year = {2026},
publisher = {The Combinatorics Consortium},
volume = {9},
number = {2},
doi = {10.5802/alco.486},
language = {en},
url = {https://alco.centre-mersenne.org/articles/10.5802/alco.486/}
}
TY - JOUR AU - Hopkins, Sam AU - Lewis, Joel B. TI - Upho lattices II: ways of realizing a core JO - Algebraic Combinatorics PY - 2026 SP - 557 EP - 575 VL - 9 IS - 2 PB - The Combinatorics Consortium UR - https://alco.centre-mersenne.org/articles/10.5802/alco.486/ DO - 10.5802/alco.486 LA - en ID - ALCO_2026__9_2_557_0 ER -
[1] Combinatorics of Coxeter groups, Graduate Texts in Mathematics, 231, Springer, New York, 2005, xiv+363 pages | DOI | MR | Zbl
[2] Hyperplane arrangements with a lattice of regions, Discrete Comput. Geom., Volume 5 (1990) no. 3, pp. 263-288 | DOI | MR | Zbl
[3] Foundations of Garside theory, EMS Tracts in Mathematics, 22, European Mathematical Society (EMS), Zürich, 2015, xviii+691 pages | DOI | Zbl | MR
[4] Gaussian groups and Garside groups, two generalisations of Artin groups, Proc. London Math. Soc. (3), Volume 79 (1999) no. 3, pp. 569-604 | DOI | MR | Zbl
[5] Asymmetric graphs, Acta Math. Acad. Sci. Hungar., Volume 14 (1963), pp. 295-315 | DOI | MR | Zbl
[6] The monoid representation of upho posets and total positivity, 2024 | arXiv | Zbl
[7] The rank-generating functions of upho posets, Discrete Math., Volume 345 (2022) no. 1, Paper no. 112629, 14 pages | DOI | Zbl | MR
[8] A note on Möbius functions of upho posets, Electron. J. Combin., Volume 29 (2022) no. 2, Paper no. 2.39, 6 pages | DOI | Zbl | MR
[9] Upho lattices I: examples and non-examples of cores, Comb. Theory, Volume 5 (2025) no. 2, Paper no. 6, 42 pages | DOI | MR | Zbl
[10] An introduction to Garside structures, PCMI summer school notes, 2005 https://web.math.ucsb.edu/...
[11] Counting unlabeled structures, J. Combin. Theory Ser. A, Volume 44 (1987) no. 1, pp. 83-93 | DOI | MR | Zbl
[12] SageMath, the Sage Mathematics Software System (Version 10.6) (2025) https://www.sagemath.org
[13] Enumerative combinatorics. Volume 1, Cambridge Studies in Advanced Mathematics, 49, Cambridge University Press, Cambridge, 2012, xiv+626 pages | DOI | Zbl | MR
[14] From Stern’s triangle to upper homogeneous posets, Talk transparencies, 2020 https://math.mit.edu/...
[15] Theorems and conjectures on some rational generating functions, European J. Combin., Volume 119 (2024), Paper no. 103814, 18 pages | DOI | MR | Zbl
Cited by Sources: