Combinatorial Nullstellensatz

In additive number theory and combinatorics, a restricted sumset has the form

:$S=\,$

where $A_1,\ldots,A_n$ are finite nonempty subsets of a field ''F'' and $P(x_1,\ldots,x_n)$ is a polynomial over ''F''.

If $P$ is a constant non-zero function, for example $P(x_1,\ldots,x_n)=1$ for any $x_1,\ldots,x_n$, then $S$ is the usual sumset $A_1+\cdots+A_n$ which is denoted by $nA$ if $A_1=\cdots=A_n=A.$

When

:$P(x_1,\ldots,x_n) = \prod_ (x_j-x_i),$

''S'' is written as $A_1\dotplus\cdots\dotplus A_n$ which is denoted by $n^ A$ if $A_1=\cdots=A_n=A.$

Note that , ''S'', > 0 if and only if there exist $a_1\in A_1,\ldots,a_n\in A_n$ with $P(a_1,\ldots,a_n)\not=0.$

Cauchy–Davenport theorem

The Cauchy–Davenport theorem, named after Augustin Louis Cauchy and Harold Davenport, asserts that for any prime ''p'' and nonempty subsets ''A'' and ''B'' of the prime order cyclic group $\mathbb/p\mathbb$ we have the inequalityGeroldinger & Ruzsa (2009) pp.141–142

:$, A+B, \ge \min\$

where $A+B := \$, i.e. we're using modular arithmetic. It can be generalised to arbitrary (not necessarily abelian) groups using a Dyson transform. If $A, B$ are subsets of a group $G$, then

:$, A+B, \ge \min\$

where $p(G)$ is the size of the smallest nontrivial subgroup of $G$ (we set it to $1$ if there is no such subgroup).

We may use this to deduce the Erdős–Ginzburg–Ziv theorem: given any sequence of 2''n''−1 elements in the cyclic group $\mathbb/n\mathbb$, there are ''n'' elements that sum to zero modulo ''n''. (Here ''n'' does not need to be prime.)Geroldinger & Ruzsa (2009) p.53

A direct consequence of the Cauchy-Davenport theorem is: Given any sequence ''S'' of ''p''−1 or more nonzero elements, not necessarily distinct, of $\mathbb/p\mathbb$, every element of $\mathbb/p\mathbb$ can be written as the sum of the elements of some subsequence (possibly empty) of ''S''.

Kneser's theorem generalises this to general abelian groups.Geroldinger & Ruzsa (2009) p.143

Erdős–Heilbronn conjecture

The Erdős–Heilbronn conjecture posed by Paul Erdős and Hans Heilbronn in 1964 states that $, 2^\wedge A, \ge \min\$ if ''p'' is a prime and ''A'' is a nonempty subset of the field Z/''p''Z. This was first confirmed by J. A. Dias da Silva and Y. O. Hamidoune in 1994
who showed that

:$, n^\wedge A, \ge \min\,$

where ''A'' is a finite nonempty subset of a field ''F'', and ''p''(''F'') is a prime ''p'' if ''F'' is of characteristic ''p'', and ''p''(''F'') = ∞ if ''F'' is of characteristic 0. Various extensions of this result were given by Noga Alon, M. B. Nathanson and I. Ruzsa in 1996, Q. H. Hou and Zhi-Wei Sun in 2002,
and G. Karolyi in 2004.

Combinatorial Nullstellensatz

A powerful tool in the study of lower bounds for cardinalities of various restricted sumsets is the following fundamental principle: the combinatorial Nullstellensatz. Let $f(x_1,\ldots,x_n)$ be a polynomial over a field $F$. Suppose that the coefficient of the monomial $x_1^\cdots x_n^$ in $f(x_1,\ldots,x_n)$ is nonzero and $k_1+\cdots+k_n$ is the total degree of $f(x_1,\ldots,x_n)$. If $A_1,\ldots,A_n$ are finite subsets of $F$ with $, A_i, >k_i$ for $i=1,\ldots,n$, then there are $a_1\in A_1,\ldots,a_n\in A_n$ such that $f(a_1,\ldots,a_n)\not = 0$.

This tool was rooted in a paper of N. Alon and M. Tarsi in 1989,
and developed by Alon, Nathanson and Ruzsa in 1995–1996,
and reformulated by Alon in 1999.

See also

* Polynomial method in combinatorics

References

*
*

External links

*{{mathworld , urlname = Erdos-HeilbronnConjecture , title = Erdős-Heilbronn Conjecture

Augustin-Louis Cauchy
Sumsets
Additive combinatorics
Additive number theory