Chains with small intervals in the lattice of binary paths

From MaRDI portal
Publication:5212152

zbMATH Open1431.05021arXiv1911.10883MaRDI QIDQ5212152FDOQ5212152


Authors: I. Tasoulas, K. Manes, A. Sapounakis, P. Tsikouras Edit this on Wikidata


Publication date: 27 January 2020

Abstract: We call an interval [x,y] in a poset {em 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.


Full work available at URL: https://arxiv.org/abs/1911.10883

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: Chains with small intervals in the lattice of binary paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212152)