Sweep maps for lattice paths - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

Sweep maps for lattice paths


Sweep maps are a family of maps on words that, while simple to define, are not yet known to be injective in general. This family subsumes many of the "zeta maps" that have arisen in the study of q,t-Catalan numbers in the course of relating the three statistics of area, bounce and dinv. A sweep map can be defined for words over arbitrary alphabets with arbitrary weights. The latter property makes them particularly suitable for the study of rational Catalan combinatorics.
Fichier principal
Vignette du fichier
dmAT0158.pdf (436.94 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01207541 , version 1 (01-10-2015)



Nicholas A. Loehr, Gregory S. Warrington. Sweep maps for lattice paths. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.667-678, ⟨10.46298/dmtcs.2432⟩. ⟨hal-01207541⟩


47 View
684 Download



Gmail Facebook X LinkedIn More