Kakeya-type sets in finite vector spaces
Name
Sudan_Kakeya-type sets.pdf
Size
218.87 KB
Format
Adobe PDF
Checksum (MD5)
82770058548a4ca1e476230e48e69cc9
Author(s)
Saraf, Shubhangi
Kopparty, Swastik
Sudan, Madhu
Lev, Vsevolod F.
Date Issued
January 2011
Journal
Journal of Algebraic Combinatorics
Publisher
Springer-Verlag
Citation
Kopparty, Swastik et al. “Kakeya-type Sets in Finite Vector Spaces.” Journal of Algebraic Combinatorics 34.3 (2011): 337–355.
Version
Author's final manuscript
Abstract
For a finite vector space V and a nonnegative integer r≤dim V, we estimate the smallest possible size of a subset of V, containing a translate of every r-dimensional subspace. In particular, we show that if K⊆V is the smallest subset with this property, n denotes the dimension of V, and q is the size of the underlying field, then for r bounded and r
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s10801-011-0274-8
