zbMATH — the first resource for mathematics

A universal bijection between Gessel-Stanley permutations and diagrams of connections of corresponding ranks. (English. Russian original) Zbl 0879.05004
Russ. Math. Surv. 51, No. 2, 333-335 (1996); translation from Usp. Mat. Nauk 51, No. 2, 165-166 (1996).
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.
Reviewer: J.Cigler (Wien)

05A15 Exact enumeration problems, generating functions
05A05 Permutations, words, matrices
Full Text: DOI