1. The rank-generating functions of upho posets
- Author
-
Karthik Seetharaman, Joshua Guo, Ilaria Seidel, and Yibo Gao
- Subjects
Vertex (graph theory) ,Discrete mathematics ,Mathematics::Combinatorics ,Pole–zero plot ,Function (mathematics) ,Type (model theory) ,Theoretical Computer Science ,Combinatorics ,FOS: Mathematics ,Mathematics - Combinatorics ,Discrete Mathematics and Combinatorics ,Order (group theory) ,Rank (graph theory) ,Combinatorics (math.CO) ,Filter (mathematics) ,Partially ordered set ,Mathematics - 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-ary 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 an uncomputable rank-generating function.
- Published
- 2022
- Full Text
- View/download PDF