Vol. 10, No. 7, 2016

Download this article
Download this article For screen
For printing
Recent Issues

Volume 19, 1 issue

Volume 18, 12 issues

Volume 17, 12 issues

Volume 16, 10 issues

Volume 15, 10 issues

Volume 14, 10 issues

Volume 13, 10 issues

Volume 12, 10 issues

Volume 11, 10 issues

Volume 10, 10 issues

Volume 9, 10 issues

Volume 8, 10 issues

Volume 7, 10 issues

Volume 6, 8 issues

Volume 5, 8 issues

Volume 4, 8 issues

Volume 3, 8 issues

Volume 2, 8 issues

Volume 1, 4 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-7833 (online)
ISSN 1937-0652 (print)
 
Author index
To appear
 
Other MSP journals
Furstenberg sets and Furstenberg schemes over finite fields

Jordan S. Ellenberg and Daniel Erman

Vol. 10 (2016), No. 7, 1415–1436
Abstract

We give a lower bound for the size of a subset of Fqn containing a rich k-plane in every direction, a k-plane Furstenberg set. The chief novelty of our method is that we use arguments on nonreduced subschemes and flat families to derive combinatorial facts about incidences between points and k-planes in space.

Keywords
Kakeya sets, Furstenberg sets
Mathematical Subject Classification 2010
Primary: 14G15
Secondary: 13P10, 42B25, 51E20
Milestones
Received: 20 April 2015
Revised: 3 May 2016
Accepted: 13 June 2016
Published: 27 September 2016
Authors
Jordan S. Ellenberg
Department of Mathematics
University of Wisconsin
480 Lincoln Drive
Madison, WI 53706
United States
Daniel Erman
Department of Mathematics
University of Wisconsin
480 Lincoln Drive
Madison, WI 53706
United States