On the size of Kakeya sets in finite fields
Tóm tắt
A Kakeya set is a subset of
Từ khóa
Tài liệu tham khảo
[AT08]AT08 N. Alon and T. Tao. Private communication. 2008.
Bourgain, J., 2004, A sum-product estimate in finite fields, and applications, Geom. Funct. Anal., 14, 27, 10.1007/s00039-004-0451-1
Bourgain, J., 1999, On the dimension of Kakeya sets and related maximal inequalities, Geom. Funct. Anal., 9, 256, 10.1007/s000390050087
Bourgain, J., 2000, Harmonic analysis and combinatorics: how much may they contribute to each other?, 13, 10.1007/bf02791532
Davies, Roy O., 1971, Some remarks on the Kakeya problem, Proc. Cambridge Philos. Soc., 69, 417, 10.1017/s0305004100046867
Katz, Nets Hawk, 1999, Bounds on arithmetic projections, and applications to the Kakeya conjecture, Math. Res. Lett., 6, 625, 10.4310/MRL.1999.v6.n6.a3
Mockenhaupt, Gerd, 2004, Restriction and Kakeya phenomena for finite fields, Duke Math. J., 121, 35, 10.1215/S0012-7094-04-12112-8
Rogers, Keith McKenzie, 2001, The finite field Kakeya problem, Amer. Math. Monthly, 108, 756, 10.2307/2695620
Schwartz, J. T., 1980, Fast probabilistic algorithms for verification of polynomial identities, J. Assoc. Comput. Mach., 27, 701, 10.1145/322217.322225
Tao, Terence, 2001, From rotating needles to stability of waves: emerging connections between combinatorics, analysis, and PDE, Notices Amer. Math. Soc., 48, 294
Tao, Terence, 2005, A new bound for finite field Besicovitch sets in four dimensions, Pacific J. Math., 222, 337, 10.2140/pjm.2005.222.337
Wolff, Thomas, 1999, Recent work connected with the Kakeya problem, 129
Zippel, Richard, 1979, Probabilistic algorithms for sparse polynomials, 216