Counting pairs of noncrossing binary paths: a bijective approach

DOI10.1016/j.disc.2018.10.016zbMath1400.05131OpenAlexW2899725959WikidataQ60692164 ScholiaQ60692164MaRDI QIDQ1625790

Kostas Manes, Aristidis Sapounakis, Panagiotis Tsikouras, Ioannis Tasoulas

Publication date: 29 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.016

zbMATH Keywords

Dyck pathsballot pathspairs of noncrossing binary paths

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Chains with Small Intervals in the Lattice of Binary Paths ⋮ Bijections for Dyck paths with colored hills ⋮ Hamiltonian intervals in the lattice of binary paths

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• General results on the enumeration of strings in Dyck paths
• Pairs of noncrossing free Dyck paths and noncrossing partitions
• A Catalan triangle
• An involution on Dyck paths and its consequences
• Dyck path enumeration
• Algebraic languages and polyominoes enumeration
• The statistic ``number of udu's in Dyck paths
• Bijections for pairs of non-crossing lattice paths and walks in the plane
• Counting strings in Dyck paths
• Vicious walkers, friendly walkers and Young tableaux: II. With a wall
• Vicious walkers and Young tableaux I: without walls
• A survey of the Fine numbers

This page was built for publication: Counting pairs of noncrossing binary paths: a bijective approach