2000 character limit reached
Partitions of nonzero elements of a finite field into pairs (1005.1177v4)
Published 7 May 2010 in math.CO, math.AC, and math.AT
Abstract: In this paper we prove that the nonzero elements of a finite field with odd characteristic can be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each pair. The algebraic and topological approaches to such problems are considered. We also give some generalizations of these results to packing translates in a finite or infinite field, and give a short proof of a particular case of the Eliahou--Kervaire--Plaigne theorem about sum-sets.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.