Geodesic
Coding parking functions by pairs of permutations
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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$.
DOI : 10.37236/1716
Classification : 05A15, 05A19, 16S36 
@article{10_37236_1716,
     author = {Yurii Burman and Michael Shapiro},
     title = {Coding parking functions by pairs of permutations},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1716},
     zbl = {1023.05007},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1716/}
}
TY  - JOUR
AU  - Yurii Burman
AU  - Michael Shapiro
TI  - Coding parking functions by pairs of permutations
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1716/
DO  - 10.37236/1716
ID  - 10_37236_1716
ER  - 
%0 Journal Article
%A Yurii Burman
%A Michael Shapiro
%T Coding parking functions by pairs of permutations
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1716/
%R 10.37236/1716
%F 10_37236_1716
Yurii Burman; Michael Shapiro. Coding parking functions by pairs of permutations. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1716

Cité par Sources :