SearcharxivSearch

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)

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

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

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR