Chains with small intervals in the lattice of binary paths

MaRDI QIDQ5212152zbMATH OpenFDO

Authors I. Tasoulas, K. Manes, A. Sapounakis, P. Tsikouras

Publication date 27 January 2020

Full work available at URL https://arxiv.org/abs/1911.10883, https://cs.uwaterloo.ca/journals/JIS/VOL23/Tsikouras/tsik15.html

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

zbMATH Keywords

binary pathchain of pathsDyck pathpartial order of paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics of partially ordered sets (06A07) Lattices (06B99)

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.

Recommendations

• The enumeration of generalized Tamari intervals
• Some properties of a new partial order on Dyck paths
• Enumeration of chains and saturated chains in Dyck lattices.
• scientific article; zbMATH DE number 5812185
• Lattices of lattice paths

Cites work

• A note on generating binary trees inA-order andB-order
• Counting pairs of noncrossing binary paths: a bijective approach
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3390759 (Why is no real title available?)
• scientific article; zbMATH DE number 2218519 (Why is no real title available?)
• Lattice path enumeration
• On the dominance partial ordering of Dyck paths
• Some applications of algebra to combinatorics
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Two shortest path metrics on well-formed parentheses strings

Cited in

(1)

• Hamiltonian intervals in the lattice of binary paths

Describes a project that uses

Uses Software

• OEIS

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)