Submit progress

on Kakeya sums-differences constant ($C_{3b}$)

The statement

$C_{3b} = SD(\{0,1,\infty\};-1)$ is the least exponent such that one has the inequality

|A \stackrel{G}{-} B| \leq \max(|A|, |B|, |A \stackrel{G}{+} B|)^{C_{3b}}

whenever $A, B$ are finite subsets of reals and $G \subset A \times B$ , where

A \stackrel{G}{\pm} B := \{ a \pm b: a \in A, b \in B\}.

What gets accepted

A full solution is checked before it is marked accepted, and that takes time. Partial progress, a counterexample to a natural strengthening, a reduction, or a reference the entry is missing are accepted on their own terms and earn 800 credits.

Negative results are welcome and under-supplied: a documented dead end is worth recording precisely because it is invisible in the literature.