Coding Parking Functions by Pairs of Permutations
暂无分享,去创建一个
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\le 7$ we describe in terms of admissible pairs the dimensions of the bi-graded components $h_{u,v}$ of diagonal harmonics ${\Bbb{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$.
[1] G. Kreweras. Une famille de polynômes ayant plusieurs propriétés énumeratives , 1980 .
[2] Mark Haiman,et al. Conjectures on the Quotient Ring by Diagonal Invariants , 1994 .
[3] Mark Haiman,et al. Vanishing theorems and character formulas for the Hilbert scheme of points in the plane , 2001, math/0201148.