Pages that link to "Item:Q1625790"
From MaRDI portal
The following pages link to Counting pairs of noncrossing binary paths: a bijective approach (Q1625790):
Displaying 10 items.
- On the enumeration of non-crossing pairings of well-balanced binary strings (Q360364) (← links)
- Analysis of bidirectional ballot sequences and random walks ending in their maximum (Q505696) (← links)
- Enumeration of non-crossing pairings on bit strings (Q616445) (← links)
- A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths (Q618174) (← links)
- Pairs of noncrossing free Dyck paths and noncrossing partitions (Q1043635) (← links)
- Bijections for pairs of non-crossing lattice paths and walks in the plane (Q2349956) (← links)
- A bijective answer to a question of Simion (Q4612115) (← links)
- Chains with Small Intervals in the Lattice of Binary Paths (Q5212152) (← links)
- An explanatory bijection of some remarkable properties of bridges (Q5961467) (← links)
- Bijections for Dyck paths with colored hills (Q6098007) (← links)