The Erdős-Heilbronn Problem for Finite Groups
نویسندگان
چکیده
Additive Number Theory can be best described as the study of sums of sets of integers. A simple example is given two subsets A and B of a set of integers, what facts can we determine about A + B where A + B := {a + b | a ∈ A and b ∈ B}? We will state a result regarding this example shortly. We note that a very familiar problem in Number Theory, namely Lagrange’s theorem that every nonnegative integer can be written as the sum of four squares, can be expressed in terms of sumsets. In particular, if we let N0 be the set of nonnegative integers and if we let S be the set of all integers that are perfect squares, then Lagrange’s Theorem has the form
منابع مشابه
On the Inverse Erdős-heilbronn Problem for Restricted Set Addition in Finite Groups
We provide a survey of results concerning both the direct and inverse problems to the Cauchy-Davenport theorem and Erdős-Heilbronn problem in Additive Combinatorics. We formulate a conjecture concerning the inverse Erdős-Heilbronn problem in nonabelian groups. We prove an inverse to the Dias da Silva-Hamidoune Theorem to Z/nZ where n is composite, and we generalize this result for nonabelian gr...
متن کاملAn Erdős–fuchs Type Theorem for Finite Groups
We establish a finite analogue of the Erdős-Fuchs theorem, showing that the representation function of a non-trivial subset of a finite abelian group cannot be nearly constant. Our results are, essentially, best possible. – Dedicated to Melvyn B. Nathanson and Carl Pomerance on the occasion of their 65th birthday
متن کامل0080 a New Extension of the Erdős - Heilbronn Conjecture
In 1964 P. Erdős and H. Heilbronn [EH] made the following challenging conjecture: If p is a prime, then for any subset A of the finite field Z/pZ we have |{x1 + x2 : x1, x2 ∈ A and x1 6= x2}| > min{p, 2|A| − 3}. It had remained open for thirty years until it was confirmed fully by Dias da Silva and Hamidoune [DH] who actually obtained the following generalization with help of the representation...
متن کاملJa n 20 08 Preprint , arXiv : 0801 . 0080 A NEW EXTENSION OF THE ERDŐS - HEILBRONN CONJECTURE
In 1964 P. Erdős and H. Heilbronn [EH] made the following challenging conjecture: If p is a prime, then for any subset A of the finite field Z/pZ we have |{x1 + x2 : x1, x2 ∈ A and x1 6= x2}| > min{p, 2|A| − 3}. It had remained open for thirty years until it was confirmed fully by Dias da Silva and Hamidoune [DH] who actually obtained the following generalization with help of the representation...
متن کاملOn a Problem of Erdős regarding Binomial Coefficients
Let d be a positive rational number. We prove the existence of infinitely many pairs (A,B) of disjoint finite subsets of N with ∏ a∈A ( 2a a ) = d ∏ b∈B ( 2b b ) . This solves in particular a problem of Erdős [2].
متن کامل