Abstract
In this paper, we introduce a generalization of m-Schröder paths. For a fixed positive integer m, the generalized m-Schröder paths are lattice paths that start at (0, 0), use the steps U = (1, 1), H = (1, 0), V1 = (0, −1), and V2 = (0, −2) which are weighted respectively by 1, h, a and b, remain weakly above the line [Formula In Abstract], and end on this line. We use generating functions and Riordan arrays to discuss the m enumeration of the partial generalized m-Schröder paths and the free generalized m-Schröder paths, and obtain a Chung-Feller property. In particular, when h = a = b = 1, we find that the number of generalized m-Schröder paths of order n equals the number of hybrid (m + 1)-ary trees with n internal nodes.
| Original language | English |
|---|---|
| Pages (from-to) | 703-719 |
| Number of pages | 17 |
| Journal | Filomat |
| Volume | 40 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2026 |
Keywords
- Chung-Feller property
- Riordan array
- generalized m-Schröder numbers
- generalized m-Schröder path
- generating function
- hybrid m-ary tree
Fingerprint
Dive into the research topics of 'Generalized m-Schröder paths and the Chung-Feller property'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver