2000 character limit reached
Restricted Product Sets under Unique Representability (1512.01673v1)
Published 5 Dec 2015 in math.CO and math.NT
Abstract: We prove some results of Kemperman--Scherk type for restricted product sets in multiplicative groups of fields (in particular, for cyclic groups). The proofs use polynomial method.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.