Search arXivSearch

arXiv · 2008.03025

$q$-dimensions of highest weight crystals and cyclic sieving phenomenon

Abstract

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 \mathsf{c} \rangle, \mathsf{s}_λ(1,q,q^2, \ldots, q^{m-1}))$ exhibits the cycle sieving phenomenon if and only if $λ$ is of the form $((am)^{b})$, where either $b=1$ or $m-1$. Moreover, in this case, we give an explicit formula to compute the number of all orbits of size $d$ for each divisor $d$ of $n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Young-Tak Oh, Euiyong Park. 2021-05-27. $q$-dimensions of highest weight crystals and cyclic sieving phenomenon. https://arxiv.org/abs/2008.03025

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