Rectangular Schroder Parking Functions Combinatorics
Combinatorics
2016-04-01 v1
Abstract
We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of (m,n)-parking functions, and associated (q,t)-analogs.
Keywords
Cite
@article{arxiv.1603.09487,
title = {Rectangular Schroder Parking Functions Combinatorics},
author = {Jean-Christophe Aval and Francois Bergeron},
journal= {arXiv preprint arXiv:1603.09487},
year = {2016}
}