A lower bound for |{a + b: a ∈ A, b ∈ B, P(a,b) ≠ 0}|
Journal of Combinatorial Theory Series A
Combinatorics, Probability and Computing
Note: A new extension of the Erdős--Heilbronn conjecture
Journal of Combinatorial Theory Series A
Linear extension of the Erdős-Heilbronn conjecture
Journal of Combinatorial Theory Series A
On value sets of polynomials over a field
Finite Fields and Their Applications
Hi-index | 0.00 |
Let G be an additive abelian group whose finite subgroups are all cyclic. Let A1,....,An, (n 1) be finite subsets of G with cardinality k 0, and let b1,....,bn, be pairwise distinct elements of G with odd order. We show that for every positive integer m ≤ (k - 1)/(n - 1) there are more than (k - 1)n-(m + 1)(n/2) sets {a1.....an} such that a1∈A1,...,an∈An, and both ai ≠ aj and mai+bi ≠ maj+bj (or both mai≠maj and ai + bi ≠ aj + bj) for all 1 ≤i. This extends a recent result of Dasgupta, Károlyi, Serra and Szegedy on Snevily's conjecture. Actually stronger results on sumsets with polynomial restrictions are obtained in this paper.