Certifying Numerical Decompositions of Compact Group Representations

by   Felipe Montealegre-Mora, et al.

We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to semi-definite programs (SDPs) with a group symmetry. Indeed, in this context, the dimension of the SDP can be significantly reduced if the irreducible representations of the group action are explicitly known. Rigorous numerical algorithms for decomposing a given group representation into irreps are known, but fairly expensive. To avoid this performance problem, existing software packages – e.g. RepLAB, which motivated the present work – use randomized heuristics. While these seem to work well in practice, the problem of to which extent the results can be trusted arises. Here, we provide rigorous guarantees applicable to finite and compact groups, as well as a software implementation that can interface with RepLAB. Under natural assumptions, a commonly used previous method due to Babai and Friedl runs in time O(n^5) for n-dimensional representations. In our approach, the complexity of running both the heuristic decomposition and the certification step is O(maxn^3 log n, D d^2 log d), where d is the maximum dimension of an irreducible subrepresentation, and D is the time required to multiply elements of the group. A reference implementation interfacing with RepLAB is provided.


page 1

page 2

page 3

page 4


The Noise-Sensitivity Phase Transition in Spectral Group Synchronization Over Compact Groups

In Group Synchronization, one attempts to find a collection of unknown g...

Cryptanalysis of a System based on Twisted Dihedral Group Algebras

Several cryptographic protocols constructed based on less-known algorith...

Group isomorphism is nearly-linear time for most orders

We show that there is a dense set Υ⊆ℕ of group orders and a constant c s...

Message-passing algorithms for synchronization problems over compact groups

Various alignment problems arising in cryo-electron microscopy, communit...

Computing simplicial representatives of homotopy group elements

A central problem of algebraic topology is to understand the homotopy gr...

A new algorithm for irreducible decomposition of representations of finite groups

An algorithm for irreducible decomposition of representations of finite ...