Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Sweep maps for latti ...
Conference paper

Sweep maps for lattice paths

Nicholas Loehr (1) (2), Gregory Warrington (3)
(1) Department of Mathematics [Blacksburg]
(2) Mathematics Department [UNSA Annapolis]
(3) Department of Mathematics & Statistics [Burlington]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2013
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Proceedings
DOI
10.46298/dmtcs.2432
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
1201312
Combinatorial polynomials arising from representations
Indicators
678
Views
808
Downloads

Sweep maps for lattice paths

Nicholas Loehr (1) (2), Gregory Warrington (3)
(1) Department of Mathematics [Blacksburg]
(2) Mathematics Department [UNSA Annapolis]
(3) Department of Mathematics & Statistics [Burlington]
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • q
  • t-Catalan numbers
  • Dyck paths
  • zeta map
  • diagonal harmonics
  • nabla operator
Preview
Loading PDF preview...