Abstract
We survey the state of research to determine the maximum size of a nonspanning subset of a finite abelian group G of order n. The smallest prime factor of n, denote it here by p, plays a crucial role. For prime order, G= Z p , this is essentially an old problem of Erdős and Heilbronn, which can be solved using a result of Dias da Silva and Hamidoune. We provide a simple new proof for the solution when n is even ( p=2). For composite odd n, we deduce the solution, for n⩾2 p 2, from results obtained years ago by Diderrich and, recently, by Gao and Hamidoune. Only a small family of cases remains unsettled.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
