Cyclic sieving and cluster multicomplexes

  • Rhoades B
  • 4


    Mendeley users who have this article in their library.
  • 2


    Citations of this article.


Reiner, Stanton and White (2004) [10] proved results regarding the enumeration of polygon dissections up to rotational symmetry. Eu and Fu (2008) [2] generalized these results to Cartan-Killing types other than A by means of actions of deformed Coxeter elements on cluster complexes of Fomin and Zelevinsky (2003) [6]. The Reiner-Stanton-White and Eu-Fu results were proven using direct counting arguments. We give representation theoretic proofs of closely related results using the notion of noncrossing and seminoncrossing tableaux due to Pylyavskyy (2009) [9] as well as some geometric realizations of finite type cluster algebras due to Fomin and Zelevinsky (2003) [5]. © 2010 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Finite type cluster algebra
  • Fixed point enumeration
  • Polygon dissection
  • Simplicial complex

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Brendon Rhoades

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free