Raney numbers, threshold sequences and Motzkin-like paths

DOI10.1016/j.disc.2022.113065zbMath1495.05014arXiv2109.05291OpenAlexW3199787217WikidataQ114196981 ScholiaQ114196981MaRDI QIDQ2166306

Irena Rusu

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.05291

zbMATH Keywords

lattice pathsMotzkin pathsCatalan numbersRaney numbers

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items (2)

Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A history and a survey of lattice path enumeration
• Staircase tilings and \(k\)-Catalan structures
• Catalan numbers, their generalization, and their uses
• Vexillary involutions are enumerated by Motzkin numbers
• A bijection between ordered trees and 2-Motzkin paths and its many consequences
• Admissible pinnacle orderings
• A problem of arrangements
• Lattice Path Enumeration
• On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
• Four Proofs of the Ballot Theorem
• ECO:a methodology for the enumeration of combinatorial objects
• Functional Composition Patterns and Power Series Reversion
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Motzkin numbers
• Bijective recurrences for Motzkin paths

This page was built for publication: Raney numbers, threshold sequences and Motzkin-like paths