Projects per year
Abstract
We present a bijection between two well-known objects in the ubiquitous Catalan family: non-decreasing parking functions and Łukasiewicz paths. This bijection maps the maximal displacement of a parking function to the height of the corresponding Łukasiewicz path, and the total displacement to the area of the path. We also study this bijection restricted to two specific families of parking-functions: unit-interval parking functions, and prime parking functions.
Original language | English |
---|---|
Pages (from-to) | 77-84 |
Journal | Discrete Mathematics Letters |
Volume | 14 |
Publication status | Published - 6 Nov 2024 |
Keywords
- Parking functions
- Łukasiewicz paths
- Catalan numbers
- Displacement statistic
- Bijection
Fingerprint
Dive into the research topics of 'Parking functions and Łukasiewicz paths'. Together they form a unique fingerprint.Projects
- 2 Active
-
Towards a combinatorial theory of sandpile models
1/01/23 → 31/12/25
Project: Internal Research Project
-
Stochastic variants of the Abelian sandpile model
1/01/22 → 31/12/24
Project: Governmental Research Project