Search arXivSearch

arXiv · 2308.07851

An imperceptible connection between the Clebsch--Gordan coefficients of $U_q(\mathfrak{sl}_2)$ and the Terwilliger algebras of Grassmann graphs

Abstract

The Clebsch--Gordan coefficients of $U(\mathfrak{sl}_2)$ are expressible in terms of Hahn polynomials. The phenomenon can be explained by an algebra homomorphism $\natural$ from the universal Hahn algebra $\mathcal H$ into $U(\mathfrak{sl}_2)\otimes U(\mathfrak{sl}_2)$. Let $Ω$ denote a finite set of size $D$ and $2^Ω$ denote the power set of $Ω$. It is generally known that $\mathbb C^{2^Ω}$ supports a $U(\mathfrak{sl}_2)$-module. Let $k$ denote an integer with $0\leq k\leq D$ and fix a $k$-element subset $x_0$ of $Ω$. By identifying $\mathbb C^{2^Ω}$ with $\mathbb C^{2^{Ω\setminus x_0}}\otimes \mathbb C^{2^{x_0}}$ this induces a $U(\mathfrak{sl}_2)\otimes U(\mathfrak{sl}_2)$-module structure on $\mathbb C^{2^Ω}$ denoted by $\mathbb C^{2^Ω}(x_0)$. Pulling back via $\natural$ the $U(\mathfrak{sl}_2)\otimes U(\mathfrak{sl}_2)$-module $\mathbb C^{2^Ω}(x_0)$ forms an $\mathcal H$-module. When $1\leq k\leq D-1$ the $\mathcal H$-module $\mathbb C^{2^Ω}(x_0)$ enfolds the Terwilliger algebra of the Johnson graph $J(D,k)$ with respect to $x_0$. This result connects these two seemingly irrelevant topics: The Clebsch--Gordan coefficients of $U(\mathfrak{sl}_2)$ and the Terwilliger algebras of Johnson graphs. Unfortunately some steps break down in the $q$-analog case. By making detours, the imperceptible connection between the Clebsch--Gordan coefficients of $U_q(\mathfrak{sl}_2)$ and the Terwilliger algebras of Grassmann graphs is successfully disclosed in this paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hau-Wen Huang. 2025-06-06. An imperceptible connection between the Clebsch--Gordan coefficients of $U_q(\mathfrak{sl}_2)$ and the Terwilliger algebras of Grassmann graphs. https://doi.org/10.1016/j.jcta.2025.106028

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