×

zbMATH — the first resource for mathematics

Reduced decompositions in hyperoctahedral groups. (English. Abridged French version) Zbl 0717.05005
Summary: We construct an analogue of Robinson-Schensted algorithm which counts the maximal length of unimodal subsequences in a given sequence and use it to parametrize reduced decompositions in the hyperoctahedral groups.

MSC:
05A15 Exact enumeration problems, generating functions
PDF BibTeX XML Cite