May 16, 2009 · We show that the set R(w_0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon.
Abstract. We show that the set R(w0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon.
We show that the set $R(w_0)$ of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon.
... ≤ 6. Page 15. References. T. Kyle Petersen and Luis Serrano, Cyclic sieving for longest reduced words in the hyperoctahedral group. arXiv: 0905.2650.
View of Cyclic Sieving for Longest Reduced Words in the ...
www.combinatorics.org › eljc › view › pdf
Cyclic Sieving for Longest Reduced Words in the Hyperoctahedral Group ...
Cyclic sieving for longest reduced words in the hyperoctahedral group. Petersen, T.Kyle; Serrano, Luis · The Electronic Journal of Combinatorics [electronic ...
It is shown that the set of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon and that the ...
Apr 30, 2010 · We show that the set R(w0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon.
International audience We show that the set $R(w_0)$ of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving ...
Cyclic sieving for longest reduced words in the hyperoctahedral group. The Electronic Journal of Combinatorics, 17(1), April 2010. [RS12] David B. Rush and ...