Cyclic sieving for longest reduced words in the hyperoctahedral group

Publication date 16 June 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0905.2650, https://eudml.org/doc/223930, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r67.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Group actions on combinatorial structures (05E18)

Abstract: We show that the set R(w_0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, R(w_0) possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on R(w_0).

Review text

Summary: We show that the set \(R(w_0)\) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, \(R(w_0)\) possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on \(R(w_0)\).

Recommendations

Cited in

(4)

This page was built for publication: Cyclic sieving for longest reduced words in the hyperoctahedral group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976718)