Search arXivSearch

arXiv · 2603.28242

Cyclic sieving phenomena on parabolic classes of faces of the cluster complex

Abstract

The cyclic sieving phenomenon was introduced by Reiner, Stanton and White in 2004 as a generalization of Stembridge's $q=-1$ phenomenon. In a paper from 2008, Eu and Fu studied many occurrences of this phenomenon on the faces of the generalized cluster complex with the action of the Fomin-Reading rotation in the classical types $A_n$, $B_n$, $D_n$ and $I_2(k)$. There was yet no known uniform $q$-analogue of the $k$-face numbers of these complexes. In a more recent paper from 2023, Douvropoulos and Josuat-Vergès provided a refinement of the enumeration of the faces of the generalized cluster complex using a uniform formula. For a parabolic subgroup $W_X \subset W$ of the associated Coxeter group $W$, their formula factorises nicely under the assumption that $N_W(W_X)/W_X$ acts as a reflection group on $X$, which is very often the case. Using this condition, we provide a uniform refinement of these cyclic sieving phenomena using a $q$-analogue of their main formula with a type by type proof based on the classification of finite irreducible Coxeter groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lucas Pouillart. 2026-03-30. Cyclic sieving phenomena on parabolic classes of faces of the cluster complex. https://arxiv.org/abs/2603.28242

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO