2000 character limit reached
On configurations where the Loomis-Whitney inequality is nearly sharp and applications to the Furstenberg set problem (1309.2372v2)
Published 10 Sep 2013 in math.CO and math.CA
Abstract: In this paper, we consider the so-called "Furstenberg set problem" in high dimensions. First, following Wolff's work on the two dimensional real case, we provide "reasonable" upper bounds for the problem for $\mathbb{R}$ or $\mathbb{F}_p$. Next we study the "critical" case and improve the "trivial" exponent by $\Omega (\frac{1}{n2})$ for $\mathbb{F}_pn$. Our key tool to obtain this lower bound is a theorem about how things behave when the Loomis-Whitney inequality is nearly sharp, as it helps us to reduce the problem down to dimension two.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.