Chains with small intervals in the lattice of binary paths
zbMATH Open1431.05021arXiv1911.10883MaRDI QIDQ5212152FDOQ5212152
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics of partially ordered sets (06A07) Lattices (06B99)
Cites Work
- Title not available (Why is that?)
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- Title not available (Why is that?)
- Two shortest path metrics on well-formed parentheses strings
- A note on generating binary trees inA-order andB-order
- Title not available (Why is that?)
- On the dominance partial ordering of Dyck paths
- Some applications of algebra to combinatorics
- Lattice path enumeration
- Counting pairs of noncrossing binary paths: a bijective approach
- Title not available (Why is that?)
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)