Designs, Codes and Cryptography Computer Science Applications

Intersective sets over abelian groups

Zixiang Xu, Chi Hoi Yip
Springer Nature · 2026-01-01 · DOI 10.1007/s10623-025-01760-3

Abstract

Abstract Given a finite abelian group G and a subset $$J\subset G$$ J ⊂ G with $$0\in J$$ 0 ∈ J , let $$D_{G}(J,N)$$ D G ( J , N ) be the maximum size of $$A\subset G^{N}$$ A ⊂ G N such that the difference set $$A-A$$ A - A and $$J^{N}$$ 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ű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)$$ D G ( J , N ) can be improved exponentially.

Read at publisher →