Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 105 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Kimi K2 193 tok/s Pro
2000 character limit reached

The Explicit Sato-Tate Conjecture For Primes In Arithmetic Progressions (1906.07903v2)

Published 19 Jun 2019 in math.NT

Abstract: Let $\tau(n)$ be Ramanujan's tau function, defined by the discriminant modular form [ \Delta(z) = q\prod_{j=1}{\infty}(1-q{j}){24}\ =\ \sum_{n=1}{\infty}\tau(n) qn \,,q=e{2\pi i z} ] (this is the unique holomorphic normalized cuspidal newform of weight 12 and level 1). Lehmer's conjecture asserts that $\tau(n)\neq 0$ for all $n\geq 1$; since $\tau(n)$ is multiplicative, it suffices to study primes $p$ for which $\tau(p)$ might possibly be zero. Assuming standard conjectures for the twisted symmetric power $L$-functions associated to $\tau$ (including GRH), we prove that if $x\geq 10{50}$, then [ #{x < p\leq 2x: \tau(p) = 0} \leq 1.22 \times 10{-5} \frac{x{3/4}}{\sqrt{\log x}},] a substantial improvement on the implied constant in previous work. To achieve this, under the same hypotheses, we prove an explicit version of the Sato-Tate conjecture for primes in arithmetic progressions.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.