On the minimum size of restricted sumsets in cyclic groups
arXiv:1305.2141
Abstract
For positive integers , , and , we let denote the minimum size of the -fold restricted sumset among all -subsets of the cyclic group of order . The value of was conjectured for prime values of and by Erdős and Heilbronn in the 1960s; Dias da Silva and Hamidoune proved the conjecture in 1994 and generalized it for an arbitrary , but little is known about the case when is composite. Here we exhibit an explicit upper bound for all , , and ; our bound is tight for all known cases (including all , , and with ). We also provide counterexamples for conjectures made by Plagne and by Hamidoune, Lladó, and Serra.
27 pages