Polynomials and Parking Functions
In a 2010 paper Haglund, Morse, and Zabrocki studied the family of polynomials $\nabla C_{p1}\dots C_{pk}1$ , where $p=(p_1,\ldots,p_k)$ is a composition, $\nabla$ is the Bergeron-Garsia Macdonald operator and the $C_\alpha$ are certain slightly modified Hall-Littlewood vertex operators. They conjec...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2012-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/3024/pdf |
| _version_ | 1797270319154593792 |
|---|---|
| author | Angela Hicks |
| author_facet | Angela Hicks |
| author_sort | Angela Hicks |
| collection | DOAJ |
| description | In a 2010 paper Haglund, Morse, and Zabrocki studied the family of polynomials $\nabla C_{p1}\dots C_{pk}1$ , where $p=(p_1,\ldots,p_k)$ is a composition, $\nabla$ is the Bergeron-Garsia Macdonald operator and the $C_\alpha$ are certain slightly modified Hall-Littlewood vertex operators. They conjecture that these polynomials enumerate a composition indexed family of parking functions by area, dinv and an appropriate quasi-symmetric function. This refinement of the nearly decade old ``Shuffle Conjecture,'' when combined with properties of the Hall-Littlewood operators can be shown to imply the existence of certain bijections between these families of parking functions. In previous work to appear in her PhD thesis, the author has shown that the existence of these bijections follows from some relatively simple properties of a certain family of polynomials in one variable x with coefficients in $\mathbb{N}[q]$. In this paper we introduce those polynomials, explain their connection to the conjecture of Haglund, Morse, and Zabrocki, and explore some of their surprising properties, both proven and conjectured. |
| first_indexed | 2024-04-25T02:02:22Z |
| format | Article |
| id | doaj.art-f0cc54440fdd4edda57c1a426ba40367 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T02:02:22Z |
| publishDate | 2012-01-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-f0cc54440fdd4edda57c1a426ba403672024-03-07T14:51:45ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502012-01-01DMTCS Proceedings vol. AR,...Proceedings10.46298/dmtcs.30243024Polynomials and Parking FunctionsAngela Hicks0Department of Mathematics [Univ California San Diego]In a 2010 paper Haglund, Morse, and Zabrocki studied the family of polynomials $\nabla C_{p1}\dots C_{pk}1$ , where $p=(p_1,\ldots,p_k)$ is a composition, $\nabla$ is the Bergeron-Garsia Macdonald operator and the $C_\alpha$ are certain slightly modified Hall-Littlewood vertex operators. They conjecture that these polynomials enumerate a composition indexed family of parking functions by area, dinv and an appropriate quasi-symmetric function. This refinement of the nearly decade old ``Shuffle Conjecture,'' when combined with properties of the Hall-Littlewood operators can be shown to imply the existence of certain bijections between these families of parking functions. In previous work to appear in her PhD thesis, the author has shown that the existence of these bijections follows from some relatively simple properties of a certain family of polynomials in one variable x with coefficients in $\mathbb{N}[q]$. In this paper we introduce those polynomials, explain their connection to the conjecture of Haglund, Morse, and Zabrocki, and explore some of their surprising properties, both proven and conjectured.https://dmtcs.episciences.org/3024/pdfparking functionsdiagonal harmonicshall-littlewood polynomials[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Angela Hicks Polynomials and Parking Functions Discrete Mathematics & Theoretical Computer Science parking functions diagonal harmonics hall-littlewood polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Polynomials and Parking Functions |
| title_full | Polynomials and Parking Functions |
| title_fullStr | Polynomials and Parking Functions |
| title_full_unstemmed | Polynomials and Parking Functions |
| title_short | Polynomials and Parking Functions |
| title_sort | polynomials and parking functions |
| topic | parking functions diagonal harmonics hall-littlewood polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/3024/pdf |
| work_keys_str_mv | AT angelahicks polynomialsandparkingfunctions |