• DocumentCode
    2048911
  • Title

    Towards Dimension Expanders over Finite Fields

  • Author

    Dvir, Zeev ; Shpilka, Amir

  • Author_Institution
    Dept. of Comput. Sci., Weizmann Inst. of Sci., Rehovot
  • fYear
    2008
  • fDate
    23-26 June 2008
  • Firstpage
    304
  • Lastpage
    310
  • Abstract
    In this paper we study the problem of explicitly constructing a dimension expander: Let Fn be the n dimensional linear space over the field F. Find a small (ideally constant) set of linear transformations from Fn to itself {Ai}iisinI such that for every linear subspace V C Fn of dimension dim(V) < n/2 we have dim (SigmaiisinIAi(V)) ges(1+alpha)ldrdim(V), where alpha > 0 is some constant. In other words, the dimension of the subspace spanned by {Ai(V)}iisinI should be at least (1 + alpha) ldr dim(V). For fields of characteristic zero Lubotzky and Zelmanov completely solved the problem by exhibiting a set of matrices, of size independent of n, having the dimension expansion property. In this paper we consider the finite field version of the problem and obtain the following results. 1. We give a constant number of matrices that expand the dimension of every subspace of dimension d < n/2 by a factor of (1 + 1/logn). 2. We give a set of O(log n) matrices with expanding factor of´ (1 + alpha), for some constant alpha > 0. Our constructions are algebraic in nature and rely on expanding Cayley graphs for the group Z/Zn and small-diameter Cayley graphs for the group SL/2(p).
  • Keywords
    computational complexity; graph theory; group theory; Cayley graphs; algebra; dimension expanders; dimensional linear space; finite fields; linear transformations; Computational complexity; Computer science; Galois fields; Space technology; Vectors; Zinc; Cayley graphs; expanders; explicit constructions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2008. CCC '08. 23rd Annual IEEE Conference on
  • Conference_Location
    College Park, MD
  • ISSN
    1093-0159
  • Print_ISBN
    978-0-7695-3169-4
  • Type

    conf

  • DOI
    10.1109/CCC.2008.19
  • Filename
    4558832