Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.03343 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912853771943936 |
|---|---|
| author | Hopkins, Sam Lewis, Joel B. |
| author_facet | Hopkins, Sam Lewis, Joel B. |
| contents | 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 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03343 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Upho lattices II: ways of realizing a core Hopkins, Sam Lewis, Joel B. Combinatorics 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 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. |
| title | Upho lattices II: ways of realizing a core |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2506.03343 |