Towards 3n-4 in groups of prime order

2023/02/16 by Vsevolod F. Lev, Lev, Vsevolod F., Oriol Serra +1
Engineering · Mathematics · #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory #Number Theory (math.NT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2302.08465

openalex publication_date 2023/02/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that if A is a subset of a group of prime order p such that |2A|<2.7652|A| and |A|<1.25⋅10^-6p, then A is contained in an arithmetic progression with at most |2A|-|A|+1 terms, and 2A contains an arithmetic progression with the same difference and at least 2|A|-1 terms. This improves a number of previously known results.

Related

• Small doubling in prime-order groups: from 2.4 to 2.6
• Narrow arithmetic progressions in the primes
• Roth's theorem in the primes
• Long Arithmetic Progressions in Critical Sets
• Structures in P based on Properties of Semigroup and Arithmetical Sequence H = (+-3*2; 1)