Counting pairs of noncrossing binary paths: a bijective approach

DOI10.1016/J.DISC.2018.10.016MaRDI QIDQ1625790zbMATH OpenOpenAlexWikidataFDO

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

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)

Recommendations

• Bijections for pairs of non-crossing lattice paths and walks in the plane
• scientific article; zbMATH DE number 2077656
• Pairs of noncrossing free Dyck paths and noncrossing partitions
• On the enumeration of non-crossing pairings of well-balanced binary strings
• On pairs of lattice paths with a given number of intersections

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3380631 (Why is no real title available?)
• A Catalan triangle
• A survey of the Fine numbers
• Algebraic languages and polyominoes enumeration
• An involution on Dyck paths and its consequences
• Bijections for pairs of non-crossing lattice paths and walks in the plane
• Counting strings in Dyck paths
• Dyck path enumeration
• General results on the enumeration of strings in Dyck paths
• Pairs of noncrossing free Dyck paths and noncrossing partitions
• The statistic ``number of udu's in Dyck paths
• Vicious walkers and Young tableaux I: without walls
• Vicious walkers, friendly walkers and Young tableaux. II: With a wall

Cited in

(11)

• Bijections for pairs of non-crossing lattice paths and walks in the plane
• Enumeration of non-crossing pairings on bit strings
• A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths
• On the enumeration of non-crossing pairings of well-balanced binary strings
• Chains with small intervals in the lattice of binary paths
• Hamiltonian intervals in the lattice of binary paths
• scientific article; zbMATH DE number 2077656 (Why is no real title available?)
• Analysis of bidirectional ballot sequences and random walks ending in their maximum
• Bijections for Dyck paths with colored hills
• A bijective answer to a question of Simion
• Pairs of noncrossing free Dyck paths and noncrossing partitions

Describes a project that uses

Uses Software

• OEIS

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

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