On the enumeration of non-crossing pairings of well-balanced binary strings
From MaRDI portal
(Redirected from Publication:360364)
Recommendations
Cites work
- scientific article; zbMATH DE number 3712896 (Why is no real title available?)
- A Left Weighted Catalan Extension
- Counting lattice paths taking steps in infinitely many directions under special access restrictions
- Counting lattice paths with privileged access using Sheffer sequences
- Enumeration of non-crossing pairings on bit strings
- Lattice paths between diagonal boundaries
- Recursive initial value problems for Sheffer sequences
- Sheffer polynomials for computing exact Kolmogorov-Smirnov and Renyi type distributions
- Staircase tilings and \(k\)-Catalan structures
- Symmetric Sheffer sequences and their applications to lattice path counting
- The enumeration of restricted random walks by Sheffer polynomials with applications to statistics
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)