Simultaneous Block Diagonalization of Matrices of Finite Order

Abstract

It is well known that a set of non-defect matrices can be simultaneously diagonalized if and only if the matrices commute. In the case of non-commuting matrices, the best that can be achieved is simultaneous block diagonalization. Here we give an efficient algorithm to explicitly compute a transfer matrix which realizes the simultaneous block diagonalization of unitary matrices whose decomposition in irreducible blocks (common invariant subspaces) is known from elsewhere. Our main motivation lies in particle physics, where the resulting transfer matrix must be known explicitly in order to unequivocally determine the action of outer automorphisms such as parity, charge conjugation, or time reversal on the particle spectrum.

arXiv comment6 pages, accepted by J.Phys.A

References in corpus (11)

• CP and Discrete Flavour Symmetries
• CP Violation from Finite Groups
• Automorphisms in Gauge Theories and the Definition of CP and P
• Group Theoretical Origin of CP Violation
• A CP-conserving multi-Higgs model without real basis
• Explicit and spontaneous breaking of SU(3) into its finite subgroups
• Spontaneous breaking of SU(3) to finite family symmetries: a pedestrian's approach
• Non-Abelian Discrete Groups from the Breaking of Continuous Flavor Symmetries
• Breaking classical Lie groups to finite subgroups - an automated approach
• Non-linearly realized discrete symmetries
• $\mathcal{C}\mathcal{P}$ violation with an unbroken $\mathcal{C}\mathcal{P}$ transformation

Cited by in corpus (4)

• Convolutional Learning on Multigraphs
• Pinning control of networks: dimensionality reduction through simultaneous block-diagonalization of matrices
• Telling compositeness at a distance with outer automorphisms and CP
• Algorithms for Simultaneous Block Triangularization and Block Diagonalization of Sets of Matrices