A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra

A combinatorial proof of the cyclic sieving phenomenon for faces of Coxeterhedra

0.00 Avg rating0 Votes
Article ID: iaor20132802
Volume: 25
Issue: 4
Start Page Number: 617
End Page Number: 638
Publication Date: May 2013
Journal: Journal of Combinatorial Optimization
Authors: , ,
Abstract:

For a Coxeter system (W,S), the subgroup W J generated by a subset JS is called a parabolic subgroup of W. The Coxeterhedron PW associated to (W,S) is the finite poset of all cosets {wW J } wW,JS of all parabolic subgroups of W, ordered by inclusion. This poset can be realized by the face lattice of a simple polytope, constructed as the convex hull of the orbit of a generic point in ℝ n under an action of the reflection group W. In this paper, for the groups W=A n−1, B n and D n in a case‐by‐case manner, we present an elementary proof of the cyclic sieving phenomenon for faces of various dimensions of PW under the action of a cyclic group generated by a Coxeter element. This result provides a geometric, enumerative and combinatorial approach to re‐prove a theorem in Reiner et al. (2004). The original proof is proved by an algebraic method that involves representation theory and Springer’s theorem on regular elements.

Reviews

Required fields are marked *. Your email address will not be published.