Arithmetic Progressions of Length Three in Multiplicative Subgroups of F_p

02/26/2019
by   Jeremy F Alm, et al.
0

In this paper, we give an algorithm for detecting non-trivial 3-APs in multiplicative subgroups of F_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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2019

Review of a Quantum Algorithm for Betti Numbers

We looked into the algorithm for calculating Betti numbers presented by ...
research
06/18/2021

Remarks about the Arithmetic of Graphs

The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where...
research
03/24/2019

Determining satisfiability of 3-SAT in polynomial time

In this paper, we provide a polynomial time (and space), algorithm that ...
research
01/07/2019

Fine-grained quantum computational supremacy

It is known that several sub-universal quantum computing models cannot b...
research
08/01/2022

On Matrix Multiplication and Polynomial Identity Testing

We show that lower bounds on the border rank of matrix multiplication ca...
research
11/22/2022

Representations of the symmetric group are decomposable in polynomial time

We introduce an algorithm to decompose orthogonal matrix representations...
research
02/21/2022

Loop unrolling of UCA models: distance labeling

A proper circular-arc (PCA) model is a pair M = (C, A) where C is a circ...

Please sign up or login with your details

Forgot password? Click here to reset