The cyclic sieving phenomenon
نویسندگان
چکیده
The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge’s q 1⁄4 1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Pólya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite field q-analogues. r 2004 Elsevier Inc. All rights reserved.
منابع مشابه
The Cyclic Sieving Phenomenon for Non-Crossing Forests
In this paper we prove that the set of non-crossing forests together with a cyclic group acting on it by rotation and a natural q-analogue of the formula for their number exhibits the cyclic sieving phenomenon, as conjectured by Alan Guo.
متن کاملThe Cyclic Sieving Phenomenon for Faces of Generalized Cluster Complexes
The notion of cyclic sieving phenomenon is introduced by Reiner, Stanton, and White as a generalization of Stembridge’s q = −1 phenomenon. The generalized cluster complexes associated to root systems are given by Fomin and Reading as a generalization of the cluster complexes found by Fomin and Zelevinsky. In this paper, the faces of various dimensions of the generalized cluster complexes in typ...
متن کاملCyclic Sieving of Noncrossing Partitions for Complex Reflection Groups
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
متن کاملInvariant Tensors and the Cyclic Sieving Phenomenon
We construct a large class of examples of the cyclic sieving phenomenon by exploiting the representation theory of semi-simple Lie algebras. Let M be a finite dimensional representation of a semi-simple Lie algebra and let B be the associated Kashiwara crystal. For r > 0, the triple (X, c, P ) which exhibits the cyclic sieving phenomenon is constructed as follows: the set X is the set of isolat...
متن کاملPromotion and Cyclic Sieving via Webs
We show that Schützenberger’s promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreover, following work of the third author, we show that this action admits the cyclic sieving phenomenon.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 108 شماره
صفحات -
تاریخ انتشار 2004