Hostname: page-component-745bb68f8f-mzp66 Total loading time: 0 Render date: 2025-02-06T16:06:31.847Z Has data issue: false hasContentIssue false

Comments on Y. O. Hamidoune's Paper ‘Adding Distinct Congruence Classes’

Published online by Cambridge University Press:  09 March 2016

BÉLA BAJNOK*
Affiliation:
Department of Mathematics, Gettysburg College, Gettysburg, PA 17325-1486, USA (e-mail: bbajnok@gettysburg.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The main result in Y. O. Hamidoune's paper ‘Adding distinct congruence classes' (Combin. Probab. Comput.7 (1998) 81–87) is as follows. If S is a generating subset of a cyclic group G such that 0 ∉ S and |S| ⩾ 5, then the number of sums of the subsets of S is at least min(|G|, 2|S|). Unfortunately, the argument of the author, who, sadly, passed away in 2011, relies on a lemma whose proof is incorrect; in fact, the lemma is false for all cyclic groups of even order. In this short note we point out this mistake, correct the proof, and discuss why the main result is actually true for all finite abelian groups.

Type
Paper
Copyright
Copyright © Cambridge University Press 2016 

References

[1] Diderrich, G. T. and Mann, H. B. (1973) Combinatorial problems in finite abelian groups. In A Survey of Combinatorial Theory (Srivastava, J. N. et al., eds), North-Holland, pp. 95100.CrossRefGoogle Scholar
[2] Gallardo, L., Grekos, G., Habsieger, L., Hennecart, F., Landreau, B. and Plagne, A. (2002) Restricted addition in $\mathbb{Z}/n\mathbb{Z}$ and an application to the Erdős–Ginzburg–Ziv problem. J. London Math. Soc. (2) 65 513523.Google Scholar
[3] Hamidoune, Y. O. (1998) Adding distinct congruence classes. Combin. Probab. Comput. 7 8187.CrossRefGoogle Scholar