Loading...
Thumbnail Image
Publication

Rhizomes of ranked posets

Castro, Rachel H.
Bingham, Aram
Citations
Altmetric:
Advisor
Editor
Date
2024-04
Date Issued
Date Submitted
Keywords
Research Projects
Organizational Units
Journal Issue
Embargo Expires
Abstract
We introduce and study the notion of a rhizome for a ranked, partially ordered set (or poset) where each set of fixed rank is finite. A rhizome is defined as a minimal size subset of the elements of rank n such that each of the elements of rank n + 1 covers at least one element of the rhizome. Given a poset P with ranked parts Pn, we consider the function rP : N → N which gives the size of a rhizome for Pn, and study this function for examples like the Boolean lattice and Young's lattice.
Associated Publications
Rights
Copyright of the original work is retained by the author.
Embedded videos