Z. Dvir
Abstract
The finite field Kakeya problem deals with the way lines in different directions can overlap in a vector space over a finite field. This problem came up in the study of certain Euclidean problems and, independently, in the search for explicit randomness extractors. We survey recent progress on this problem and describe several of its applications.
- S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. J. ACM, 45(3):501--555, 1998. Google Scholar
Digital Library
- S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. J. ACM, 45(1):70--122, 1998. Google ScholarDigital Library
- J. Bennett, A. Carbery, and T. Tao. On the multilinear restriction and Kakeya conjectures. Acta Mathematica, 196:261--302, 2006.Google ScholarCross Ref
- A. Besicovitch. On Kakeya's problem and a similar one. Mathematische Zeitschrift, (27):312--320, 1928.Google Scholar
- L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Complexity Theory, 3:307--318, 1993. Google ScholarDigital Library
- J. Bourgain, N. Katz, and T. Tao. A sum-product estimate in finite fields, and applications. Geom. Funct. Anal., 14(1):27--57, 2004.Google ScholarCross Ref
- J. Bourgain. On the dimension of Kakeya sets and related maximal inequalities. Geom. Funct. Anal., 9(2):256--282, 1999.Google ScholarCross Ref
- J. Bourgain. Harmonic analysis and combinatorics: How much may they contribute to each other? IMU/Amer. Math. Soc., pages 13--32, 2000.Google Scholar
- Z. Dvir, S. Kopparty, S. Saraf, andM. Sudan. Extensions to the method of multiplicities, with applications to kakeya sets and mergers. In FOCS 09 (to appear), 2009. Google ScholarDigital Library
- Z. Dvir and A. Shpilka. An improved analysis of linear mergers. Comput. Complex., 16(1):34--59, 2007. (Extended abstract appeared in RANDOM 2005). Google ScholarDigital Library
- Z. Dvir. On the size of Kakeya sets in finite fields. J. AMS (to appear), 2008.Google Scholar
- Z. Dvir and A. Wigderson. Kakeya sets, new mergers and old extractors. In FOCS '08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pages 625--633, Washington, DC, USA, 2008. IEEE Computer Society. Google ScholarDigital Library
- G. Elekes, H. Kaplan, and M. Sharir. On lines, joints, and incidences in three dimensions, 2009. Manuscript.Google Scholar
- J. Ellenberg, R. Oberlin, and T. Tao. The Kakeya set and maximal conjectures for algebraic varieties over finite fields, 2009. Manuscript.Google Scholar
- S. Feldman and M. Sharir. An improved bound for joints in arrangements of lines in space. Discrete Comput. Geom., 33(2):307--320, 2005. Google ScholarDigital Library
- L. Guth and N. H. Katz. Algebraic methods in discrete analogs of the Kakeya problem, 2008. Manuscript.Google Scholar
- V. Guruswami and A. Rudra. Explicit codes achieving list decoding capacity: Errorcorrection with optimal redundancy. IEEE Transactions on Information Theory, 54(1):135--150, 2008. Google ScholarDigital Library
- M. Gromov. Isoperimetry of waists and concentration of maps. Geom. Funct. Anal.,Google Scholar
- V. Guruswami and M. Sudan. Improved decoding of Reed-Solomon and algebraicgeometry codes. IEEE Transactions on Information Theory, 45(6):1757--1767, 1999. Google ScholarDigital Library
- L. Guth. The endpoint case of the Bennett-Carbery-Tao multilinear Kakeya conjecture, 2008. Manuscript.Google Scholar
- V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes. J. ACM, 56(4):1--34, 2009. Google ScholarDigital Library
- H. Kaplan, M. Sharir, and E. Shustin. On lines and joints, 2009. Manuscript.Google Scholar
- N. Katz and T. Tao. New bounds for Kakeya problems. Journal d'Analyse de Jerusalem, 87:231--263, 2002.Google ScholarCross Ref
- R. Zippel. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, pages 216--226. Springer-Verlag, 1979. Google ScholarDigital Library
Recommendations
Guest Column: A Recipe for Constructing Two-Source Extractors
Randomness is a valuable resource in computation. Randomness is used to run various Monte Carlo simulations of complex systems such as the stock market or weather prediction systems. Various randomized algorithms have been discovered that often vastly ...
Pseudo-Random Pattern Generator Design for Column-Matching BIST
DSD '07: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and ToolsThis paper discusses possibilities for a choice of a pseudorandom pattern generator that is to be used in combination with the column-matching based built-in self-test design method. The pattern generator should be as small as possible, whereas patterns ...
Rotation and translation invariants of Gaussian-Hermite moments
Geometric moment invariants are widely used in many fields of image analysis and pattern recognition since their first introduction by Hu in 1962. A few years ago, Flusser has proved how to find the independent and complete set of geometric moment ...
Comments