David Bessis, Victor Reiner
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 polynomials in $q$. We then show that these polynomials exhibit the cyclic sieving phenomenon on annular noncrossing permutations. We also show that a sum of annular $q$-Kreweras numbers becomes an annular $q$-Narayana number and a sum of $q$-Narayana numbers becomes an annular $q$-Catalan number.
Let $a < b$ be coprime positive integers. Armstrong, Rhoades, and Williams defined a set $\mathsf{NC}(a,b)$ of `rational noncrossing partitions', which form a subset of the ordinary noncrossing partitions of $\{1, 2, \dots, b-1\}$. Confirming a conjecture of Armstrong et. al., we prove that $\mathsf{NC}(a,b)$ is closed under rotation and prove an instance of the cyclic sieving phenomenon for this rotational action. We also define a rational generalization of the $\mathfrak{S}_a$-noncrossing parking functions of Armstrong, Reiner, and Rhoades.
For coprime positive integers $a<b$, Armstrong, Rhoades, and Williams (2013) defined a set $NC(a,b)$ of rational noncrossing partitions, a subset of the ordinary noncrossing partitions of $\{1, \ldots, b-1\}$. Bodnar and Rhoades (2015) confirmed their conjecture that $NC(a,b)$ is closed under rotation and proved an instance of the cyclic sieving phenomenon for this rotation action. We give a definition of $NC(a,b)$ which works for all coprime $a$ and $b$ and prove closure under rotation and cyclic sieving in this more general setting. We also generalize noncrossing parking functions to all cop…
Reiner, Stanton, and White \cite{RSWCSP} proved results regarding the enumeration of polygon dissections up to rotational symmetry. Eu and Fu \cite{EuFu} 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 \cite{FZY}. 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 semi-noncrossing tableaux due to Pylyavskyy \cite{PN} as well as some geometric realiz…
We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner. This manuscript accompanies the paper "Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type" [arXiv:1001.0028], for which it provides the computational details.
We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated complex reflection groups. The computational details are provided in the manuscript "Cyclic sieving for generalised non-crossing partitions associated to complex reflection groups of exceptional type - the details" [arXiv:1001.0030].
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 $q$-analogue exhibits the cyclic sieving phenomenon under a natural action of the cyclic group. The enumeration and cyclic sieving is generalized to Möbius paths. We also discuss properties of a generalization of cyclic sieving, which we call subset cyclic sieving. Finally, we also introduce the notion of Lyndon-like cyclic sieving that concerns special recursive …
Cyclic sieving on noncrossing (1,2)-configurations
本文研究非交叉(1,2)-配置$X_n$，定义统计量$cwt$以生成$q$-Catalan数，证明其生成函数模等价式，并在二面体群作用下证明二面体筛选结果，分别回答Thiel和Kim的问题。
We prove an instance of the cyclic sieving phenomenon in non-crossing connected graphs, as conjectured by S.-P. Eu.
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.
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.
Free action and cyclic sieving on skew semi-standard Young tableaux
该研究给出半标准Young表循环筛分现象相关定理的简短证明，并将结果推广到斜形状情形。
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 the major index statistic (resp. the inversion statistic) gives rise to a CSP when $q=2$ or $q=3$ (resp. when $q=2$). A byproduct is a curious characterization of the irreducible polynomials in $F_2[x]$ and $F_3[x]$ that are primitive.
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.
The Garsia--Haiman module is a bigraded $\mathfrak{S}_n$-module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an $\mathfrak{S}_n$-set $X$ to a graded polynomial ring. The orbit harmonics can be applied to prove cyclic sieving phenomena which is a notion that encapsulates the fixed-point structure of finite cyclic group action on a finite set. By applying this idea to the Garsia--Haiman module, we provide cyclic sieving results regarding the enumeration of matrices that are invariant under certain cyclic row and column rotation and translation of entrie…
We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(λ,μ)$ of shape $λ=(m,n^b)$ and content $μ$, a $(b+2)$-tuple. We prove that $(SSYT(λ,μ),\langle \partial^{b+2} \rangle, f(q))$ exhibits the cyclic sieving phenomenon, where $\partial$ is the jeu de taquin promotion operator and $f(q)$ is a modified Kostka-Foulkes polynomial $\widetilde{K}_{λ,μ}(q)$, up to a power of $q$.
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 $\left(X_n,C_{n-1},\frac{1}{[n+1]_q}{2n \brack n}_q\right)$ exhibits the cyclic sieving phenomenon. We prove their suspicion right.
We prove a cyclic sieving result for the set of $3 \times k$ packed increasing tableaux with maximum entry $m :=3+k$ under K-promotion. The "curiosity" is that the sieving polynomial arises from the $q$-hook formula for standard tableaux of "toothbrush shape" $(2^3, 1^{k-2})$ with $m+1$ boxes, whereas K-promotion here only has order $m$.
Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point locus in $\mathbb{C}^n$. The cyclic sieving phenomenon is a notion in enumerative combinatorics which encapsulates the fixed-point structure of the action of a finite cyclic group $C$ on a finite set $X$ in terms of root-of-unity evaluations of an auxiliary polynomial $X(q)$. We apply orbit harmonics to prove cyclic sieving results.
We introduce and study a new action of the symmetric group $\mathfrak{S}_n$ on the vector space spanned by noncrossing partitions of $\{1, 2, \dots, n\}$ in which the adjacent transpositions $(i, i+1) \in \mathfrak{S}_n$ act on noncrossing partitions by means of skein relations. We characterize the isomorphism type of the resulting module and use it to obtain new representation theoretic proofs of cyclic sieving results due to Reiner-Stanton-White and Pechenik for the action of rotation on various classes of noncrossing partitions and the action of K-promotion on two-row rectangular increasing…
The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of the most impressive instances of the cyclic sieving phenomenon is a theorem of Rhoades asserting that the set of plane partitions in a rectangular box under the action of promotion exhibits cyclic sieving. In Rhoades's result the sieving polynomial is the size generating function for these plane partitions, which has a well-known product formula due to MacMah…
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 type $A_n$, $B_n$, $D_n$, and $I_2(a)$ are shown to exhibit the cyclic sieving phenomenon under a cyclic group action. For the cluster complexes of exceptional type $E_6$, $E_7$, $E_8$, $F_4$, $H_3$, and $H…
In this paper we prove instances of the cyclic sieving phenomenon for finite Grassmannians and partial flag varieties, which carry the action of various tori in the finite general linear group GL_n(F_q). The polynomials involved are sums of certain weights of the minimal length parabolic coset representatives of the symmetric group S_n, where the weight of a coset representative can be written as a product over its inversions.
It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed cycle type and fixed number of excedances provides an instance of the cyclic sieving phenonmenon of Reiner, Stanton and White. The main tool is a class of symmetric functions recently introduced in work of two of the authors.
We show that the cyclic sieving phenomenon of Reiner--Stanton--White together with necklace generating functions arising from work of Klyachko offer a remarkably unified, direct, and largely bijective approach to a series of results due to Kraskiewicz--Weyman, Stembridge, and Schocker related to the so-called higher Lie modules and branching rules for inclusions $ C_a \wr S_b \hookrightarrow S_{ab} $. Extending the approach gives monomial expansions for certain graded Frobenius series arising from a generalization of Thrall's problem.
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 conditions for an action. This polynomial will give us a lot of information about the symmetry and structure of the set under the action. In this paper, we study the cyclic sieving phenomenon of the cyclic group $C_{2n}$ acting on $P_{n,k}$, which is the set of matchings of $2n$ points on a circle with $k$ crossings. The noncrossing matchings ($k=0$) was recently…
Super Major Index Cyclic Sieving
本文研究了矩形形状的带符号标准 Young 表的循环筛分现象，结合 Schützenberger 提升和符号循环移位，证明其由超主指数生成函数描述，扩展了 Rhoades 的经典结果，并推广到任意非矩形形状。
In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in the root poset of a finite Weyl group). In this paper we identify Panyushev's map with the Kreweras complement on the set of noncrossing partitions, and hence construct the first uniform bijection between nonnesting and noncrossing partitions. Unfortunately, the proof that our construction is well-defined is case-by-case, using a computer in the exceptional types. Fortunately, the proof involves new and interesting combinatorics in the classical types. As consequences, we prove several conjectur…
We discuss two surprising properties of a family of polynomials that generalize the Mahonian $q$-Catalan polynomials, and more generally the $q$-Schröder polynomials. By interpreting them as $\mathfrak{sl}_2$-characters, we show that the rational $q$-Schröder polynomials are parity-unimodal, which means that the even- and odd-degree coefficients are separately unimodal. Second, we show that they exhibit a $q=-1$ phenomenon. This is a special case of a more general cyclic sieving phenomenon for certain transitive $S_n$-actions, deduced from Molien's formula.
Cyclic sieving for a class of rectangular domino tableaux
本文研究了矩形多米诺表格的循环筛分现象，通过计数得到新的恒等式，并推测了更一般的CSP。
Recently, a combinatorial model for torsion pairs in the cluster category of Dynkin type A_n was introduced, and used to derive an explicit formula for their number. In this article we determine the number of torsion pairs that are invariant under b-fold application of Auslander-Reiten translation. It turns out that the set of torsion pairs together with Auslander-Reiten translation, and a natural q-analogue of the formula for the number of all torsion pairs exhibits the cyclic sieving phenomenon.
A cyclic sieving phenomenon for symplectic tableaux
本文利用 Kashiwara-Nakashima 辛表的 crystal 结构，以 Weyl 群单反射乘积作为循环群作用，证明了辛表与辛斜表的循环筛分现象，其多项式为钩长-容度公式的 $q$-模拟。
Refined Catalan and Narayana cyclic sieving
本研究针对A型与B型Catalan对象，证明了循环筛分现象（CSP）的若干新实例，并对已知CSP实例按耳数、短边数、环与边数等参数进行精细化拓展。
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 quotient of a finite Coxeter group. In type A, this result can be phrased in terms of the natural cyclic action on words of fixed content. There is a natural notion of refinement for many CSP's. We formulate and prove a refinement, with respect to the major index statistic, of this CSP on words of fixed content by also fixing the cyclic descent type. The argu…
In this paper, we study a new cyclic sieving phenomenon on the set $\mathsf{SST}_n(λ)$ of semistandard Young tableaux with the cyclic action $\mathsf{c}$ arising from its $U_q(\mathfrak{sl}_n)$-crystal structure. We prove that if $λ$ is a Young diagram with $\ell(λ) < n$ and $\gcd( n, |λ| )=1$, then the triple $\left( \mathsf{SST}_n(λ), \mathsf{C}, q^{- κ(λ)} s_λ(1,q, \ldots, q^{n-1}) \right) $ exhibits the cyclic sieving phenomenon, where $\mathsf{C}$ is the cyclic group generated by $\mathsf{c}$. We further investigate a connection between $\mathsf{c}$ and the promotion $\mathsf{pr}$ and sho…
Cyclic Sieving for Staircase Plane Partitions via Crystals and Electrical Networks
研究高度为二的阶梯平面划分提升作用的循环筛选结果，利用自旋晶体张量幂解释及电网络空间坐标环二次部分的灌木丛基证明，还探讨了所有度数上电典范基存在时对所有高度阶梯平面划分提升的循环筛选意义。
We show that the set R(w_0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, R(w_0) possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on R(w_0).
Promotion and cyclic sieving on families of SSYT
该研究针对几类半标准杨表，验证其在提升操作下的循环筛分现象，提出计算斜半标准杨表电荷的新方法，推广了此前相关研究结果。
The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a similar result for dihedral groups and suggest approaches for natural generalizations to nonabelian groups.
An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a bijection between rectangular 2-row increasing tableaux and small Schröder paths. We demonstrate relations between the jeu de taquin for increasing tableaux developed by H. Thomas and A. Yong and the combinatorics of tropical frieze patterns. We then use this jeu de taquin to present new instances of the cyclic sieving phenomenon of V. Reiner, D. Stanton, a…
We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Apéry numbers, by means of a general criterion involving higher derivatives at roots of unity. Our methods lead us to discover new examples of the cyclic sieving phenomenon, involving the $q$-Lucas numbers.
The cyclic sieving phenomenon was defined by Reiner, Stanton, and White in a 2004 paper. Let X be a finite set, C be a finite cyclic group acting on X, and f(q) be a polynomial in q with nonnegative integer coefficients. Then the triple (X,C,f(q)) exhibits the cyclic sieving phenomenon if, for all g in C, we have # X^g = f(w) where # denotes cardinality, X^g is the fixed point set of g, and w is a root of unity chosen to have the same order as g. It might seem improbable that substituting a root of unity into a polynomial with integer coefficients would have an enumerative meaning. But many in…
We prove a collection of conjectures of D. White \cite{WComm}, as well as some related conjectures of Abuzzahab-Korson-Li-Meyer \cite{AKLM} and of Reiner and White \cite{ReinerComm}, \cite{WComm}, regarding the cyclic sieving phenomenon of Reiner, Stanton, and White \cite{RSWCSP} as it applies to jeu-de-taquin promotion on rectangular tableaux. To do this, we use Kazhdan-Lusztig theory and a characterization of the dual canonical basis of $\mathbb{C}[x_{11}, ..., x_{nn}]$ due to Skandera \cite{SkanNNDCB}. Afterwards, we extend our results to analyzing the fixed points of a dihedral action on r…
We construct a large class of examples of the cyclic sieving phenomenon by expoiting 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\ge 0$, the triple $(X,c,P)$ which exhibits the cyclic sieving phenomenon is constructed as follows: the set $X$ is the set of isolated vertices in the crystal $\otimes^rB$; the map $c\colon X\rightarrow X$ is a generalisation of promotion acting on standard tableaux of rectangular shape and the polynomial $P$ is the fake degre…
We study rotation of invariant vectors in tensor products of minuscule representations. We define a combinatorial notion of rotation of minuscule Littelmann paths. Using affine Grassmannians, we show that this rotation action is realized geometrically as rotation of components of the Satake fibre. As a consequence, we have a basis for invariant spaces which is permuted by rotation (up to global sign). Finally, we diagonalize the rotation operator by showing that its eigenspaces are given by intersection homology of quiver varieties. As a consequence, we generalize Rhoades' work on the cyclic s…
Cyclic sieving phenomena for trees and tree-rooted maps
本文证明了角根平面树（有序树）在四种循环群作用下的循环筛分现象，并推广到树根平面地图。
The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers of cyclic group actions on finite sets using q-analogue polynomials. Eu and Fu demonstrated a cyclic sieving phenomenon on generalized cluster complexes of every type using the q-Catalan numbers. In this paper, we exhibit the dihedral sieving phenomenon, introduced for odd n by Rao and Suk, on clusters of every type. In the type A case, we show that the Raney numbers count both reflection-symmetric k-angulations of an n-gon and a particular evaluation of the (q,t)-Fuss--Catalan numbers. We also introduce …
Let $k$ and $m$ be positive integers and $λ/μ$ a skew partition. We compute the principal specialization of the skew Schur polynomials $s_{λ/μ}(x_1, \ldots, x_{k})$ modulo $q^m-1$ under suitable conditions. We interpret the results thus obtained from the viewpoint of the cyclic sieving phenomenon on semistandard Young skew tableaux of shape $λ/μ$. As an application, we deal with evaluations of the principal specialization of the skew Schur polynomials at roots of unity.
Cyclic sieving phenomena via combinatorics of continued fractions
本文利用连分数恒等式研究排列、集合划分、完美匹配和D-排列上的循环筛分现象，重新证明并推广Corteel对合相关结果，证明两个猜想，并构造新的Genocchi-Corteel对合。
The paper concerns a definition for $q$-Kreweras numbers for finite Weyl groups $W$, refining the $q$-Catalan numbers for $W$, and arising from work of the second author. We give explicit formulas in all types for the $q$-Kreweras numbers. In the classical types $A, B, C$, we also record formulas for the $q$-Narayana numbers and in the process show that the formulas depend only on the Weyl group (that is, they coincide in types $B$ and $C$). In addition we verify that in the classical types $A,B,C,D$ that the $q$-Kreweras numbers obey the expected cyclic sieving phenomena when evaluated at app…
We construct a (bi)cyclic sieving phenomenon on the union of dominant maximal weights for level $\ell$ highest weight modules over an affine Kac-Moody algebra with exactly one highest weight being taken for each equivalence class, in a way not depending on types, ranks and levels. In order to do that, we introduce $\textbf{\textit{S}}$-evaluation on the set of dominant maximal weights for each highest modules, and generalize Sagan's action by considering the datum on each affine Kac-Moody algebra. As consequences, we obtain closed and recursive formulae for cardinality of the number of dominan…
Skew characters and cyclic sieving
该研究将矩形标准杨表的循环分块现象结果推广至满足伪次数多项式单位根取值非负的斜标准杨表，通过边界条杨表数界的方法确定斜特征承载循环群置换表示的情形，并应用于一般线性群伴随表示张量幂不变量理论，证明置换与交错杨表间存在与旋转、晋升交错的双射。
Cyclic sieving phenomena on parabolic classes of faces of the cluster complex
本文研究了抛物面类的聚类复形上的循环筛现象，通过统一公式对这些现象进行细化，并基于有限不可约Coxeter群的分类给出类型特定的证明。
Cyclic Sieving for Strong Dichotomy Enumeration
本文研究了如何利用循环求和方法对强二元划分进行枚举，证明了当k为奇数时，刚性模式库存 polynomial 在-1处的评估结果能够正确计数强类。
The Cyclic Sieving Phenomenon and frieze patterns
本文研究了循环求和现象在多边形划分和三角剖分中的应用，并通过双射关系扩展了蛇形图案与 Dyck 路径的联系。
In this paper, we compute explicitly the $q$-dimensions of highest weight crystals modulo $q^n-1$ for a quantum group of arbitrary finite type under certain assumption, and interpret the modulo computations in terms of the cyclic sieving phenomenon. This interpretation gives an affirmative answer to the conjecture by Alexandersson and Amini. As an application, under the assumption that $λ$ is a partition of length $<m$ and there exists a fixed point in $\mathsf{SST}_m(λ)$ under the action $\mathsf{c}$ arising from the crystal structure, we show that the triple $(\mathsf{SST}_m(λ), \langle \mat…
Cyclic sieving, skew Macdonald polynomials and Schur positivity
该研究证明了分拆部分为n的倍数时，特殊化非对称麦克唐纳多项式对应的填充集合满足循环筛分现象，引入其斜版本并证明Schur正性，还得到一类新LLT多项式的组合Schur展开。
On zero-sum polytopes: reciprocity, rigidity, and cyclic sieving
引入零和多面体，将零和序列计数转化为有理Ehrhart理论问题，证明组合互反定理，建立面分层刚性，并研究自同构群作用下的循环筛分现象。
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 corresponds to a non-negative integer matrix which jointly records the statistic and cyclic order distribution associated with the set of objects realizing the CSP. In particular we consider a universal subcone onto which every CSP matrix linearly projects such that the projection realizes a CSP with the same cyclic orbit structure, but via a universal statistic tha…
We introduce a decorated configuration space $\mathscr{C}\!{\rm onf}_n^\times(a)$ with a potential function $\mathcal{W}$. We prove the cluster duality conjecture of Fock-Goncharov for Grassmannians, that is, the tropicalization of $\big(\mathscr{C}\!{\rm onf}_n^\times(a), \mathcal{W}\big)$ canonically parametrizes a linear basis of the homogeneous coordinate ring of the Grassmannian $\operatorname{Gr}_a(n)$ with respect to the Plücker embedding. We prove that $\big(\mathscr{C}\!{\rm onf}_n^\times(a), \mathcal{W}\big)$ is equivalent to the mirror Landau-Ginzburg model of the Grassmannian consi…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。