Arithmetic Progressions of Length Three in Multiplicative Subgroups of $\mathbb{F}_p$
Number Theory
2019-02-27 v1 Data Structures and Algorithms
Abstract
In this paper, we give an algorithm for detecting non-trivial 3-APs in multiplicative subgroups of that is substantially more efficient than the naive approach. It follows that certain Var der Waerden-like numbers can be computed in polynomial time.
Keywords
Cite
@article{arxiv.1902.10046,
title = {Arithmetic Progressions of Length Three in Multiplicative Subgroups of $\mathbb{F}_p$},
author = {Jeremy F Alm},
journal= {arXiv preprint arXiv:1902.10046},
year = {2019}
}
Comments
8 pages, 2 figures. The proof of Theorem 2 follows closely the proof of Theorem 4 from arXiv:1609.01817