DeepAI AI Chat
Log In Sign Up

Near-Optimal Cayley Expanders for Abelian Groups

by   Akhil Jalan, et al.

We give an efficient deterministic algorithm that outputs an expanding generating set for any finite abelian group. The size of the generating set is close to the randomized construction of Alon and Roichman (1994), improving upon various deterministic constructions in both the dependence on the dimension and the spectral gap. By obtaining optimal dependence on the dimension we resolve a conjecture of Azar, Motwani, and Naor (1998) in the affirmative. Our technique is an extension of the bias amplification technique of Ta-Shma (2017), who used random walks on expanders to obtain expanding generating sets over the additive group of n-bit strings. As a consequence, we obtain (i) randomness-efficient constructions of almost k-wise independent variables, (ii) a faster deterministic algorithm for the Remote Point Problem, (iii) randomness-efficient low-degree tests, and (iv) randomness-efficient verification of matrix multiplication.


page 1

page 2

page 3

page 4


On the Use of Randomness in Local Distributed Graph Algorithms

We attempt to better understand randomization in local distributed graph...

Which groups are amenable to proving exponent two for matrix multiplication?

The Cohn-Umans group-theoretic approach to matrix multiplication suggest...

On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress

Motivated by studying the power of randomness, certifying algorithms and...

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification

We give an efficient algorithm that transforms any bounded degree expand...

Matrix multiplication via matrix groups

In 2003, Cohn and Umans proposed a group-theoretic approach to bounding ...

Deterministic constructions of high-dimensional sets with small dispersion

The dispersion of a point set P⊂[0,1]^d is the volume of the largest box...