Papers
Topics
Authors
Recent
Search
2000 character limit reached

Clebsch-Gordan coefficients of discrete groups in subgroup bases

Published 7 Nov 2017 in hep-ph, hep-th, math-ph, and math.MP | (1711.02272v2)

Abstract: We express each Clebsch-Gordan (CG) coefficient of a discrete group as a product of a CG coefficient of its subgroup and a factor, which we call an embedding factor. With an appropriate definition, such factors are fixed up to phase ambiguities. Particularly, they are invariant under basis transformations of irreducible representations of both the group and its subgroup. We then impose on the embedding factors constraints, which relate them to their counterparts under complex conjugate and therefore restrict the phases of embedding factors. In some cases, the phase ambiguities are reduced to sign ambiguities. We describe the procedure of obtaining embedding factors and then calculate CG coefficients of the group \mathcal{PSL}{2}\left(7\right) in terms of embedding factors of its subgroups S{4} and \mathcal{T}_{7}.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.