English

Interlaced rectangular parking functions

Combinatorics 2015-03-16 v1

Abstract

The aim of this work is to extend to a general Sm×SnS_m\times S_n-module context the Grossman-Bizley paradigm that allows the enumeration of Dyck paths in a m×nm\times n-rectangle. We obtain an explicit formula for the the "bi-Frobenius" characteristic of what we call {\em interlaced} rectangular parking functions in an m×nm\times n-rectangle. These are obtained by labelling the nn vertical steps of an m×nm\times n-Dyck path by the numbers from 11 to nn, together with an independent labelling of its horizontal steps by integers from 11 to mm. Our formula specializes to give the Frobenius characteristic of the SnS_n-module of m×nm\times n-parking functions in the general situation. Hence, it subsumes the result of Armstrong-Loehr-Warrington which furnishes such a formula for the special case when mm and nn are coprime integers.

Keywords

Cite

@article{arxiv.1503.03991,
  title  = {Interlaced rectangular parking functions},
  author = {Jean-Christophe Aval and François Bergeron},
  journal= {arXiv preprint arXiv:1503.03991},
  year   = {2015}
}
R2 v1 2026-06-22T08:52:03.264Z