Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Graham's rearrangement conjecture beyond the rectification barrier (2409.07403v2)

Published 11 Sep 2024 in math.CO and math.NT

Abstract: A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus {0}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A| \leqslant e{(\log p){1/4}}$; our result improves the previous bound of $\log p/\log \log p$. One ingredient in our argument is a structure theorem involving dissociated sets, which may be of independent interest.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com