Related papers: Refined Catalan and Narayana cyclic sieving
The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…
The cyclic sieving phenomenon (CSP) was introduced by Reiner, Stanton, and White to study combinatorial structures with actions of cyclic groups. The crucial step is to find a polynomial, for example a q-analog, that satisfies the CSP…
Based on computational experiments, Jim Propp and Vic Reiner suspected that there might exist a sequence of combinatorial objects $X_n$, each carrying a natural action of the cyclic group $C_{n-1}$ of order $n-1$ such that the triple…
We show an instance of the cyclic sieving phenomenon on annular noncrossing permutations with given cycle types. We define annular $q$-Kreweras numbers, annular $q$-Narayana numbers, and annular $q$-Catalan number, all of which are…
Verifying a suspicion of Propp and Reiner concerning the cyclic sieving phenomenon (CSP), M. Thiel introduced a Catalan object called noncrossing $(1,2)$-configurations (denoted by $X_n$), which is a class of set partitions of $[n-1]$. More…
We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…
Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…
Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action and a polynomial. A key example arises from the length generating function for minimal length coset representatives of a parabolic…
We show how to derive new instances of the cyclic sieving phenomenon from old ones via elementary representation theory. Examples are given involving objects such as words, parking functions, finite fields, and graphs.
We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone…
When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…
Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
We exhibit two instances of the cyclic sieving phenomenon - one on dissections of a polygon of a fixed type and one on triangulations of a once-punctured polygon. We use these results to give refined enumerations of certain families of…
We give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…
Prompted by a question of Jim Propp, this paper examines the cyclic sieving phenomenon (CSP) in certain cyclic codes. For example, it is shown that, among dual Hamming codes over $F_q$, the generating function for codedwords according to…
We develop a cylindrical shape decomposition (CSD) algorithm to decompose an object, a union of several tubular structures, into its semantic components. We decompose the object using its curve skeleton and restricted translational sweeps.…
This article introduces and investigates a refinement of alternating sign trapezoids by means of Catalan objects and Motzkin paths. Alternating sign trapezoids are a generalisation of alternating sign triangles, which were recently…
We perform a systematic study of permutation statistics and bijective maps on permutations using SageMath to search the FindStat combinatorial statistics database to identify apparent instances of the cyclic sieving phenomenon (CSP). Cyclic…
Event-B provides a flexible framework for stepwise system development via refinement. The framework supports steps for (a) refining events (one-by-one), (b) splitting events (one-by-many), and (c) introducing new events. In each of the…