Down-step statistics in generalized Dyck paths
The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied. Results are proved bijectively and by means of generating functions, and lead to sever...
Main Authors: | Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2022-05-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/7163/pdf |
Similar Items
-
Flip-sort and combinatorial aspects of pop-stack sorting
by: Andrei Asinowski, et al.
Published: (2021-04-01) -
Growing and Destroying Catalan-Stanley Trees
by: Benjamin Hackl, et al.
Published: (2018-02-01) -
Consecutive Patterns in Inversion Sequences
by: Juan S. Auli, et al.
Published: (2019-11-01) -
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
by: Colin Defant
Published: (2021-04-01) -
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01)