Derandomized Non-Abelian Homomorphism Testing in Low Soundness Regime

TL;DR

This paper introduces a derandomized homomorphism testing method for functions from finite groups to unitary matrices, improving efficiency in the low soundness regime and connecting to Fourier analysis and representation theory.

Contribution

It presents a novel derandomized homomorphism test for matrix-valued functions on finite groups, extending prior results to low randomness settings.

Findings

Efficient correlation detection with genuine homomorphisms.

Non-trivial Fourier mass on low-dimensional irreducible representations.

A new degree-2 expander mixing lemma for small-bias subsets.

Abstract

We give a randomness-efficient homomorphism test in the low soundness regime for functions, $f: G\to \mathbb{U}_t$, from an arbitrary finite group $G$ to $t\times t$ unitary matrices. We show that if such a function passes a derandomized Blum--Luby--Rubinfeld (BLR) test (using small-bias sets), then (i) it correlates with a function arising from a genuine homomorphism, and (ii) it has a non-trivial Fourier mass on a low-dimensional irreducible representation. In the full randomness regime, such a test for matrix-valued functions on finite groups implicitly appears in the works of Gowers and Hatami [Sbornik: Mathematics '17], and Moore and Russell [SIAM Journal on Discrete Mathematics '15]. Thus, our work can be seen as a near-optimal derandomization of their results. Our key technical contribution is a "degree-2 expander mixing lemma'' that shows that Gowers' $\mathrm{U}^2$ norm can be efficiently estimated by restricting it to a small-bias subset. Another corollary is a "derandomized'' version of a useful lemma due to Babai, Nikolov, and Pyber [SODA'08] and Gowers [Comb. Probab. Comput.'08].