On the enumeration of non-crossing pairings of well-balanced binary strings
From MaRDI portal
Publication:360364
DOI10.1007/S00026-013-0186-5zbMATH Open1270.05011OpenAlexW2054484087MaRDI QIDQ360364FDOQ360364
Authors: Paul R. F. Schumacher, Catherine Yan
Publication date: 26 August 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-013-0186-5
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Cites Work
- Title not available (Why is that?)
- Sheffer polynomials for computing exact Kolmogorov-Smirnov and Renyi type distributions
- The enumeration of restricted random walks by Sheffer polynomials with applications to statistics
- Recursive initial value problems for Sheffer sequences
- Lattice paths between diagonal boundaries
- Symmetric Sheffer sequences and their applications to lattice path counting
- Counting lattice paths with privileged access using Sheffer sequences
- A Left Weighted Catalan Extension
- Counting lattice paths taking steps in infinitely many directions under special access restrictions
- Enumeration of non-crossing pairings on bit strings
- Staircase tilings and \(k\)-Catalan structures
Cited In (4)
This page was built for publication: On the enumeration of non-crossing pairings of well-balanced binary strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360364)