k-Naples parking functions are counted recursively, characterized for k=1 by a map to classical parking functions, and bijected to signature Dyck paths.
Gonz´ alez D’Le´ on,Signature catalan combinatorics , Journal of Combinatorics 10 (2019), 725–773.↑4, 10, 12
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Generalization of Parking Functions Allowing Backward Movement
k-Naples parking functions are counted recursively, characterized for k=1 by a map to classical parking functions, and bijected to signature Dyck paths.