Search arXivSearch

arXiv · 2209.07713

The Ariki--Koike algebras and Rogers--Ramanujan type partitions

Abstract

In 2000, Ariki and Mathas showed that the simple modules of the Ariki--Koike algebras $\mathcal{H}_{\mathbb{C},q;Q_1,\ldots, Q_m}\big(G(m, 1, n)\big)$ (when the parameters are roots of unity and $q\neq 1$) are labeled by the so-called Kleshchev multipartitions. This together with Ariki's categorification theorem enabled Ariki and Mathas to obtain the generating function for the number of Kleshchev multipartitions by making use of the Weyl--Kac character formula. In this paper, we revisit this generating function for the $q=-1$ case. This $q=-1$ case is particularly interesting, for the corresponding Kleshchev multipartitions have a very close connection to generalized Rogers--Ramanujan type partitions when $Q_1=\cdots=Q_a=-1$ and $Q_{a+1}=\cdots =Q_m =1$. Based on this connection, we provide an analytic proof of the result of Ariki and Mathas for $q=Q_1=\cdots Q_a=-1$ and $Q_{a+1}=\cdots =Q_m =1$. Our second objective is to investigate simple modules of the Ariki--Koike algebra in a fixed block. It is known that these simple modules in a fixed block are labeled by the Kleshchev multiparitions with a fixed partition residue statistic. This partition statistic is also studied in the works of Berkovich, Garvan, and Uncu. Employing their results, we provide two bivariate generating function identities when $m=2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shane Chern, Zhitai Li, Dennis Stanton, Ting Xue, Ae Ja Yee. 2022-09-16. The Ariki--Koike algebras and Rogers--Ramanujan type partitions. https://arxiv.org/abs/2209.07713

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