Chains with Small Intervals in the Lattice of Binary Paths
I. Tasoulas,
K. Manes,
A. Sapounakis
et al.
Abstract:We call an interval [x, y] in a poset small if y is the join of some elements covering x. In this paper, we study the chains of paths from a given arbitrary (binary) path P to the maximum path having only small intervals. More precisely, we obtain and use several formulas for the enumeration of chains having only small intervals and minimal length. For this, we introduce and study the notions of filling and degree of a path, giving in addition some related statistics.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.