Track new results across pure and applied mathematics.
Search papers, labs, and topics across Lattice.
This paper establishes a near-quadratic lower bound for the size of sets in $\F_p$ where every sum of two elements has at least two distinct representations as unordered pairs, proving $m(p)\ge2^{-80}\left(\frac{\log p}{\log\log p}\right)^2$ for $p\ge64$. The proof leverages unit-pivot elimination to compress the integer collision lattice, followed by a random sampling and bounded-diameter forest approach to identify surviving coordinates, ultimately yielding a nonzero minor divisible by $p$. Complementary constructions demonstrate an upper bound of $m(p)\le\frac{(\log p)^2}{2(\log3)^2} +\left(\frac1{4\log3}+o(1)\right) \frac{(\log p)^2}{\log\log p}$, implying $m(p)=(\log p)^{2+o(1)}$.
A near-quadratic lower bound for sets with no unique sums in finite fields is established, revealing a surprising structural constraint on additive combinatorics.
Let $m(p)$ be the least size of a subset of $\F_p$ with at least two elements for which every sum has two distinct representations as unordered pairs, allowing repetition. We prove that, for every prime $p\ge64$, \[ m(p)\ge2^{-80}\left(\frac{\log p}{\log\log p}\right)^2. \] The argument compresses the full integer collision lattice by unit-pivot elimination. A shared random sample and forests of bounded diameter give $O(\sqrt n+n/\log p)$ surviving coordinates of polynomial height for a minimal set of size $n$. A nonzero minor divisible by $p$ then gives the lower bound. We also construct weakly ternary-balanced seeds yielding \[ m(p)\le\frac{(\log p)^2}{2(\log3)^2} +\left(\frac1{4\log3}+o(1)\right) \frac{(\log p)^2}{\log\log p}. \] Consequently $m(p)=(\log p)^{2+o(1)}$ as $p$ tends to infinity through the primes. The constant-factor order of $m(p)$ remains undetermined.