2000 character limit reached
Proof of the Kakeya set conjecture over rings of integers modulo square-free
Published 23 Nov 2020 in math.CO and math.CA | (2011.11225v2)
Abstract: A Kakeya set is a set containing a line in each direction. We show that, when is any square-free integer, the size of the smallest Kakeya set in is at least for any -- resolving a special case of a conjecture of Hickman and Wright. Previously, such bounds were only known for the case of prime . We also show that the case of general can be reduced to lower bounding the rank of the incidence matrix of points and hyperplanes over .
Paper Prompts
Sign up for free to create and run prompts on this paper.