Skip to Main content Skip to Navigation
Conference papers

Sweep maps for lattice paths

Abstract : 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.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, October 1, 2015 - 9:28:02 AM
Last modification on : Friday, April 16, 2021 - 3:34:01 PM
Long-term archiving on: : Saturday, January 2, 2016 - 10:34:20 AM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads