Some new problems in additive combinatorics

Abstract

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) n distinct numbers (or elements of an additive abelian group) a1,…,an with adjacent sums ai+ai+1 (or differences ai-ai+1) pairwise distinct. For an odd prime power q=2n+1>13 with q=25, we show that there is a circular permutation (a1,…,an) of the elements of S=\a2:\ a∈ Fq\0\\ such that \a1+a2,…,an-1+an,an+a1\=S, where Fq denotes the field of order q. For any finite subset A of an additive torsion-free abelian group G with |A|=n>3, we prove that there is a numbering a1,…,an of the elements of A such that a1+2a2,\ a2+2a3,\ …,\ an-1+2an,\ an+2a1 are pairwise distinct. We also pose 30 open conjectures for further research.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…