The Rank-Generating Functions of Upho Posets
Yibo Gao, Joshua Guo, Karthik Seetharaman, Ilaria Seidel

TL;DR
This paper explores the properties of upho posets, constructing examples with specific algebraic features, categorizing planar cases, and demonstrating the existence of an uncomputable rank-generating function, advancing understanding of this poset class.
Contribution
It introduces new upho posets with Schur-positive Ehrenborg functions, classifies planar upho posets' rank-generating functions, and proves the existence of an uncomputable case.
Findings
Constructed upho posets with Schur-positive Ehrenborg functions
Categorized rank-generating functions of planar upho posets
Proved existence of an upho poset with uncomputable rank-generating function
Abstract
Upper homogeneous finite type (upho) posets are a large class of partially ordered sets with the property that the principal order filter at every vertex is isomorphic to the whole poset. Well-known examples include k-array trees, the grid graphs, and the Stern poset. Very little is known about upho posets in general. In this paper, we construct upho posets with Schur-positive Ehrenborg quasisymmetric functions, whose rank-generating functions have rational poles and zeros. We also categorize the rank-generating functions of all planar upho posets. Finally, we prove the existence of an upho poset with uncomputable rank-generating function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Topics in Algebra
