Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 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

Intersective sets over abelian groups (2207.00053v2)

Published 30 Jun 2022 in math.CO and math.NT

Abstract: Given a finite abelian group $G$ and a subset $J\subset G$ with $0\in J$, let $D_{G}(J,N)$ be the maximum size of $A\subset G{N}$ such that the difference set $A-A$ and $J{N}$ have no non-trivial intersection. Recently, this extremal problem has been widely studied for different groups $G$ and subsets $J$. In this paper, we generalize and improve the relevant results by Alon and by Heged\H{u}s by building a bridge between this problem and cyclotomic polynomials with the help of algebraic graph theory. In particular, we construct infinitely many non-trivial families of $G$ and $J$ for which the current known upper bounds on $D_{G}(J, N)$ can be improved exponentially. We also obtain a new upper bound $D_{\mathbb{F}_{p}}({0,1},N)\le (\frac{1}{2}+o(1))(p-1){N}$, which improves the previously best-known result by Huang, Klurman, and Pohoata.

Summary

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