New proof of Kemperman's theorem

From MaRDI portal
Publication:5262031

zbMATH Open1398.11028arXiv1301.0095MaRDI QIDQ5262031FDOQ5262031


Authors: Tomas Boothby, Matt DeVos, Amanda Montejano Edit this on Wikidata


Publication date: 9 July 2015

Abstract: Let G be an additive abelian group and let A,BsubseteqG be finite and nonempty. The pair (A,B) is called critical if the sumset a in Aandbin B satisfies |A+B|<|A|+|B|. Vosper proved a theorem which characterizes all critical pairs in the special case when |G| is prime. Kemperman generalized this by proving a structure theorem for critical pairs in an arbitrary abelian group. Here we give a new proof of Kemperman's Theorem.


Full work available at URL: https://arxiv.org/abs/1301.0095

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (12)





This page was built for publication: New proof of Kemperman's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262031)