DOAJ Open Access 2014

Sweep maps for lattice paths

Nicholas Loehr Gregory Warrington

Abstrak

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.

Topik & Kata Kunci

Penulis (2)

N

Nicholas Loehr

G

Gregory Warrington

Format Sitasi

Loehr, N., Warrington, G. (2014). Sweep maps for lattice paths. https://doi.org/10.46298/dmtcs.2432

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2432
Informasi Jurnal
Tahun Terbit
2014
Sumber Database
DOAJ
DOI
10.46298/dmtcs.2432
Akses
Open Access ✓