Upho lattices II: ways of realizing a core

Read full text
Authors: Sam Hopkins, Joel B. Lewis
Cited by: 0

Abstract

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 ℕ -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.

Fields of Study & Subjects

Advanced Algebra and Logic Fuzzy and Soft Set Theory Logic programming and type systems

Publication details

Journal / source
Algebraic Combinatorics
Volume
9
Issue
2
Pages
557–575
Publication date
30 April 2026
Language
EN