Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Combinatorica
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A new family of Cayley expanders (?)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
(MATH) A set S in the vector space FFpn is "good" if it satisfies the following (almost) equivalent conditions:S is an expanding generating set of Abelian group FFpn.S are the rows of a generating matrix for a linear distance error-correcting code in FFpn.All (nontrivial) Fourier coefficients of S are bounded by some &egr; ξ 1 (i.e. the set S is &egr;-biased). .A good set S must have at least cn vectors (with cρ1). We study conditions under which S is the orbit of only constant number of vectors, under the action of a finite group G on the coordinates. Such succinctly described sets yield very symmetric codes, and "amplifies" small constant-degree Cayley expanders to exponentially larger ones [19, 2].For the regular action (the coordinates are named by the elements of the group G), we develop representation theoretic conditions on the group G which guarantee the existence (in fact, abundance) of such few expanding orbits. The condition is a (nearly tight) upper bound on the distribution of dimensions of the irreducible representations of G, and is the main technical contribution of this paper. We further show a class of groups for which this condition is implied by the expansion properties of the group G itself! Combining these, we can iterate the amplification process above, and give (near-constant degree) Cayley expanders which are built from Abelian components.For other natural actions, such as of the affine group on a finite field, we give the first explicit construction of such few expanding orbits. In particular, we can completely derandomize the probabilistic construction of expanding generators in [2].