Arithmetic Progressions of Length Three in Multiplicative Subgroups of \mathbbF_p

2019/02/26 by Alm, Jeremy F
#11B25 #11Y16 #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1902.10046

Abstract

In this paper, we give an algorithm for detecting non-trivial 3-APs in multiplicative subgroups of \mathbbF_p^× that is substantially more efficient than the naive approach. It follows that certain Var der Waerden-like numbers can be computed in polynomial time.

Related

• Avoiding a star of three-term arthmetic progressions
• Towards 3n-4 in groups of prime order
• Arithmetic progressions in multiplicative groups of finite fields
• Strong Bounds for 3-Progressions
• Supersimplicity and arithmetic progressions