Abstract
Given a finite abelian group and a subset with , let be the maximum size of such that the difference set and have no non-trivial intersection. Recently, this extremal problem has been widely studied for different groups and subsets . In this paper, we generalize and improve the relevant results by Alon and by Hegedű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 and for which the current known upper bounds on can be improved exponentially.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.