2016/03/31 by Jean-Christophe Aval, François Bergeron, Aval, Jean-Christophe +2
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Mathematical Dynamics and Fractals #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1603.09487
arxiv created 2016/03/31 · openalex publication_date 2016/03/31 · arxiv updated 2016/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.