Coding parking functions by pairs of permutations

MaRDI QIDQ1408526zbMATH OpenFDO

Authors D. Massart, Yu Burman, Michael Shapiro

Publication date 24 September 2003

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/122958, http://www.emis.de/journals/EJC/Volume_10/Abstracts/v10i1r23.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Ordinary and skew polynomial rings and semigroup rings (16S36)

Review text

Summary: We introduce a new class of admissible pairs of triangular sequences and prove a bijection between the set of admissible pairs of triangular sequences of length \(n\) and the set of parking functions of length \(n\). For all \(u\) and \(v=0,1,2,3\) and all \(n \leq 7\) we describe in terms of admissible pairs the dimensions of the bi-graded components \(h_{u,v}\) of diagonal harmonics \(\mathbb{C}[x_1,\dots,x_n;y_1,\dots,y_n]/S_n\), i.e., polynomials in two groups of \(n\) variables modulo the diagonal action of symmetric group \(S_n\).

Recommendations

• On increasing and invariant parking sequences
• Parking functions, valet functions and priority queues
• Parking functions, Shi arrangements, and mixed graphs
• Interlaced rectangular parking functions
• Two parking function bijections: A sharpening of the q,t-Catalan and Shröder theorems

Cited in

(3)

• Enumeration of \((p,q)\)-parking functions
• Affine permutations and rational slope parking functions
• Bounded height interlaced pairs of parking functions

This page was built for publication: Coding parking functions by pairs of permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408526)