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 for dihedral groups (2503.18101v1)

Published 23 Mar 2025 in math.CO

Abstract: A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{F}p \setminus {0}$ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever $|A| \leq e{c(\log p){1/4}}$. In this paper, we will use a similar procedure to obtain an upper bound of the same type in the case of dihedral groups $Dih{p}$.

Summary

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