Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1209.4656

A new set of generators and a physical interpretation for the SU(3) finite subgroup D(9,1,1;2,1,1)

Bela Bauer·Claire Levaillant
View original source ↗Read source document ↗Export metadata ↓

Abstract

After 100 years of effort, the classification of all the finite subgroups of SU(3) is yet incomplete. The most recently updated list can be found in P.O. Ludl, J. Phys. A: Math. Theor. 44 255204 (2011), where the structure of the series (C) and (D) of SU(3)-subgroups is studied. We provide a minimal set of generators for one of these groups which has order 162. These generators appear up to phase as the image of an irreducible unitary braid group representation issued from the Jones-Kauffman version of SU(2) Chern-Simons theory at level 4. In light of these new generators, we study the structure of the group in detail and recover the fact that it is isomorphic to the semidirect product Z_9 \times Z_3 \rtimes S_3 with respect to conjugation.

Explore related subjects

math.GRmath-phmath.MPmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bela Bauer, Claire Levaillant. 2012-09-20. A new set of generators and a physical interpretation for the SU(3) finite subgroup D(9,1,1;2,1,1). https://doi.org/10.1007/s11128-013-0544-6

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

KEEP EXPLORING

Related papers

arXiv2026

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR↗
arXiv2026

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR↗
arXiv2026

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR↗