On the enumeration of non-crossing pairings of well-balanced binary strings

DOI10.1007/s00026-013-0186-5zbMath1270.05011MaRDI QIDQ360364

Paul R. F. Schumacher, Catherine Huafei 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

zbMATH Keywords

Catalan numbers; binary strings; differential Goncharov polynomials; non-crossing pairings

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A19: Combinatorial identities, bijective combinatorics

05A05: Permutations, words, matrices

Related Items

Valid Plane Trees: Combinatorial Models for RNA Secondary Structures with Watson--Crick Base Pairs

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The enumeration of restricted random walks by Sheffer polynomials with applications to statistics
• Sheffer polynomials for computing exact Kolmogorov-Smirnov and Renyi type distributions
• Recursive initial value problems for Sheffer sequences
• Lattice paths between diagonal boundaries
• Symmetric Sheffer sequences and their applications to lattice path counting
• A Left Weighted Catalan Extension