Geodesic
Parking functions, tree depth and factorizations of the full cycle into transpositions
Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020).

Voir la notice de l'article provenant de la source Episciences

Consider the set Fn of factorizations of the full cycle (0 1 2 · · · n) ∈ S{0,1,...,n} into n transpositions. Write any such factorization (a1 b1) · · · (an bn) with all ai < bi to define its lower and upper sequences (a1, . . . , an) and (b1,...,bn), respectively. Remarkably, any factorization can be uniquely recovered from its lower (or upper) sequence. In fact, Biane (2002) showed that the simple map sending a factorization to its lower sequence is a bijection from Fn to the set Pn of parking functions of length n. Reversing this map to recover the factorization (and, hence, upper sequence) corresponding to a given lower sequence is nontrivial. 
@article{DMTCS_2020_special_379_a22,
     author = {Irving, John and Rattan, Amarpreet},
     title = {Parking functions, tree depth and factorizations of the full cycle into transpositions},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)},
     year = {2020},
     doi = {10.46298/dmtcs.6340},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6340/}
}
TY  - JOUR
AU  - Irving, John
AU  - Rattan, Amarpreet
TI  - Parking functions, tree depth and factorizations of the full cycle into transpositions
JO  - Discrete mathematics & theoretical computer science
PY  - 2020
VL  - DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6340/
DO  - 10.46298/dmtcs.6340
LA  - en
ID  - DMTCS_2020_special_379_a22
ER  - 
%0 Journal Article
%A Irving, John
%A Rattan, Amarpreet
%T Parking functions, tree depth and factorizations of the full cycle into transpositions
%J Discrete mathematics & theoretical computer science
%D 2020
%V DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6340/
%R 10.46298/dmtcs.6340
%G en
%F DMTCS_2020_special_379_a22
Irving, John; Rattan, Amarpreet. Parking functions, tree depth and factorizations of the full cycle into transpositions. Discrete mathematics & theoretical computer science, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016), DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) (2020). doi : 10.46298/dmtcs.6340. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6340/

Cité par Sources :