scholarly journals Lehmer numbers and primitive roots modulo a prime

2019 ◽  
Vol 203 ◽  
pp. 68-79 ◽  
Author(s):  
Stephen D. Cohen ◽  
Tim Trudgian
Keyword(s):  
Primitive Roots ◽  
Lehmer Numbers

The distribution of primitive roots in finite fields

1990 ◽  
Vol 45 (1) ◽  
pp. 223-224 ◽  
Author(s):  
G I Perel'muter ◽  
I E Shparlinskii
Keyword(s):  
Finite Fields ◽  
Primitive Roots

GENERALIZING THE TITCHMARSH DIVISOR PROBLEM

2012 ◽  
Vol 08 (03) ◽  
pp. 613-629 ◽  
Author(s):  
ADAM TYLER FELIX
Keyword(s):  
Natural Number ◽  
Asymptotic Relation ◽  
Divisor Problem ◽  
Implied Constant ◽  
Artin's Conjecture ◽  
Primitive Roots

Let a be a natural number different from 0. In 1963, Linnik proved the following unconditional result about the Titchmarsh divisor problem [Formula: see text] where c is a constant dependent on a. Titchmarsh proved the above result assuming GRH for Dirichlet L-functions in 1931. We establish the following asymptotic relation: [Formula: see text] where Ck is a constant dependent on k and a, and the implied constant is dependent on k. We also apply it a question related to Artin's conjecture for primitive roots.

scholarly journals The Jones polynomial: quantum algorithms and applications in quantum complexity theory

2008 ◽  
Vol 8 (1&2) ◽  
pp. 147-180
Author(s):  
P. Wocjan ◽  
J. Yard
Keyword(s):  
Quantum Computation ◽  
Braid Group ◽  
Quantum Algorithms ◽  
Primitive Root ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Roots Of Unity ◽  
Complete Problems ◽  
Primitive Roots ◽  
Quantum Complexity

We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof of a result of Freedman et al.\ that any quantum computation can be replaced by an additive approximation of the Jones polynomial, evaluated at almost any primitive root of unity. Our proof encodes two-qubit unitaries into the rectangular representation of the eight-strand braid group. We then give QCMA-complete and PSPACE-complete problems which are based on braids. We conclude with direct proofs that evaluating the Jones polynomial of the plat closure at most primitive roots of unity is a \#P-hard problem, while learning its most significant bit is PP-hard, circumventing the usual route through the Tutte polynomial and graph coloring.

scholarly journals On some arithmetical properties of Lucas and Lehmer numbers

1982 ◽  
Vol 40 (4) ◽  
pp. 369-373 ◽  
Author(s):  
Kalman Győry
Keyword(s):  
Lehmer Numbers

Detecting Large Simple Rational Hecke Modules for Γ0(N) via Congruences

2018 ◽  
Vol 2020 (19) ◽  
pp. 6149-6168
Author(s):  
Michael Lipnowski ◽  
George J Schaeffer
Keyword(s):  
Modular Forms ◽  
Class Number ◽  
Target Space ◽  
Large Set ◽  
Hecke Eigenvalues ◽  
Artin's Conjecture ◽  
Number Problem ◽  
Novel Method ◽  
Hecke Modules ◽  
Primitive Roots

Abstract We describe a novel method for bounding the dimension $d$ of the largest simple Hecke submodule of $S_{2}(\Gamma _{0}(N);\mathbb{Q})$ from below. Such bounds are of interest because of their relevance to the structure of $J_{0}(N)$, for instance. In contrast with previous results of this kind, our bound does not rely on the equidistribution of Hecke eigenvalues. Instead, it is obtained via a Hecke-compatible congruence between the target space and a space of modular forms whose Hecke eigenvalues are easily controlled. We prove conditional bounds, the strongest of which is $d\gg _{\epsilon } N^{1/2-\epsilon }$ over a large set of primes $N$, contingent on Soundararajan’s heuristics for the class number problem and Artin’s conjecture on primitive roots. For prime levels $N\equiv 7\mod 8,$ our method yields an unconditional bound of $d\geq \log _{2}\log _{2}(\frac{N}{8})$, which is larger than the known bound of $d\gg \sqrt{\log \log N}$ due to Murty–Sinha and Royer. A stronger unconditional bound of $d\gg \log N$ can be obtained in more specialized (but infinitely many) cases. We also propose a number of Maeda-style conjectures based on our data, and we outline a possible congruence-based approach toward the conjectural Hecke simplicity of $S_{k}(\textrm{SL}_{2}(\mathbb{Z});\mathbb{Q})$.

Sign in / Sign up

Export Citation Format

Share Document