Rectangular Schroder Parking Functions Combinatorics
classification
🧮 math.CO
keywords
schroderfunctionsparkingpathsanalogsassociatedcloselycombinatorics
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.