June 30, 2022
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.
Similar papers 1
April 20, 2015
We provide upper bounds on the largest subsets of $\{1,2,\dots,N\}$ with no differences of the form $h_1(n_1)+\cdots+h_{\ell}(n_{\ell})$ with $n_i\in \mathbb{N}$ or $h_1(p_1)+\cdots+h_{\ell}(p_{\ell})$ with $p_i$ prime, where $h_i\in \mathbb{Z}[x]$ lie in in the classes of so-called intersective and $\mathcal{P}$-intersective polynomials, respectively. For example, we show that a subset of $\{1,2,\dots,N\}$ free of nonzero differences of the form $n^j+m^k$ for fixed $j,k\in \...
November 12, 2013
Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the translates $X+ k_i$ is not contained in $A$. For any $g \geq h \geq 2$, we prove that if $A \subset \{1,2, \dots ,n \}$ is a $C_h[g]$-set in $\mathbb{Z}$, then $|A| \leq (g-1)^{1/h} n^{1 - 1/h} + O(n^{1/2 - 1/2h})$. We show that for any intege...
September 16, 2017
We show that a non-empty subset of an abelian group with a small edge boundary must be large; in particular, if $A$ and $S$ are finite, non-empty subsets of an abelian group such that $S$ is independent, and the edge boundary of $A$ with respect to $S$ does not exceed $(1-\gamma)|S||A|$ with a real $\gamma\in(0,1]$, then $|A| \ge 4^{(1-1/d)\gamma |S|}$, where $d$ is the smallest order of an element of $S$. Here the constant $4$ is best possible. As a corollary, we derive an...
October 18, 2022
Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as $(2+o(1))|A|^2/|A-A|$ representations as a difference of two elements of $A$; that is, the second largest number of representations is, essentially, twice the average. Here the coefficient $2$ is the best possible. We also prove continuous and multidime...
July 13, 2021
The study of intersection problems in Extremal Combinatorics dates back perhaps to 1938, when Paul Erd\H{o}s, Chao Ko and Richard Rado proved the (first) `Erd\H{o}s-Ko-Rado theorem' on the maximum possible size of an intersecting family of $k$-element subsets of a finite set. Since then, a plethora of results of a similar flavour have been proved, for a range of different mathematical structures, using a wide variety of different methods. Structures studied in this context ha...
October 21, 2022
Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\ a_i\not=a_{i+1} \ \text{for}\ 1\le i<n\}$$ and $$C(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_i\in A_i\ (1\le i\le n),\ \text{and}\ a_i\not=a_{i+1} \ \text{for}\ 1\le i<n,\ \text{and}\ a_n\not=a_1\}$$ recently introduced by the second author, when $G...
July 11, 2018
For a finite abelian group $G$ written additively, and a non-empty subset $A\subset [1,\exp(G)-1]$ the weighted Davenport Constant of $G$ with respect to the set $A$, denoted $D_A(G)$, is the least positive integer $k$ for which the following holds: Given an arbitrary $G$-sequence $(x_1,\ldots,x_k)$, there exists a non-empty subsequence $(x_{i_1},\ldots,x_{i_t})$ along with $a_{j}\in A$ such that $\sum_{j=1}^t a_jx_{i_j}=0$. In this paper, we pose and study a natural new extr...
December 13, 2016
In a finite abelian group $G$, define an additive matching to be a collection of triples $(x_i, y_i, z_i)$ such that $x_i + y_j + z_k = 0$ if and only if $i = j = k$. In the case that $G = \mathbb{F}_2^n$, Kleinberg, building on work of Croot-Lev-Pach and Ellenberg-Gijswijt, proved a polynomial upper bound on the size of an additive matching. Fox and Lov\'{a}sz used this to deduce polynomial bounds on Green's arithmetic removal lemma in $\mathbb{F}_2^n$. If $G$ is taken to ...
November 9, 2018
Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences $T=\prod_{i\in I}g_{i}$ of $S$ such that $\sum_{i\in I}a_{i}g_{i}=g$ , where $I\subseteq\left\{ 1,\ldots,t\right\} $ and $a_{i}\in A$. In this paper, we prove that $N_{A,0}(S)\geq2^{|S|-D_{A}(G)+1}$, when $A=\left\{ 1,\ldots,n-1\right\} $, where...
September 15, 2015
Let $G$ be a group. The intersection graph of cyclic subgroups of $G$, denoted by $\mathscr I_c(G)$, is a graph having all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\mathscr I_c(G)$ are adjacent if and only if their intersection is non-trivial. In this paper, we classify the finite groups whose intersection graph of cyclic subgroups is one of totally disconnected, complete, star, path, cycle. We show that for a given finite group $G$, $g...