an:01027820
Zbl 0879.05004
Koganov, L. M.
A universal bijection between Gessel-Stanley permutations and diagrams of connections of corresponding ranks
EN
Russ. Math. Surv. 51, No. 2, 333-335 (1996); translation from Usp. Mat. Nauk 51, No. 2, 165-166 (1996).
00039862
1996
j
05A15 05A05
Gessel-Stanley permutations; tree; word; alphabet
A word of length \(2k\) in the alphabet \(\{1,2, \dots, k\}\) with (a) each letter of the alphabet occurs twice, and (b) between two successive occurrences of any particular letter there can appear only letters that are strictly greater than it, is called a Gessel-Stanley (GS) permutation. In this paper various bijections between GS-permutations and other combinatorial objects are given.
J.Cigler (Wien)