Learn More
The cyclic sieving phenomenon is defined for generating functions of a set affording a cyclic group action, generalizing Stembridge's q ¼ À1 phenomenon. The phenomenon is shown to appear in various situations, involving q-binomial coefficients, Poíya–Redfield theory, polygon dissections, noncrossing partitions, finite reflection groups, and some finite(More)
We explain how the moments of the (weight function of the) Askey Wilson polynomials are related to the enumeration of the staircase tableaux introduced by the first and fourth authors [11, 12]. This gives us a direct combinatorial formula for these moments, which is related to, but more elegant than the formula given in [11]. Then we use techniques(More)
Let M be a finite matroid with rank function r. We will write A ⊆ M when we mean that A is a subset of the ground set of M , and write M | A and M/A for the matroids obtained by restricting M to A, and contracting M on A respectively. Let M * denote the dual matroid to M. (See [1] for definitions). The main theorem is Theorem 1. The Tutte polynomial T M (x,(More)