Fast multi-precision computation of some Euler products
From MaRDI portal
Publication:4999479
DOI10.1090/mcom/3630zbMath1468.11249arXiv1908.06808OpenAlexW3120632303MaRDI QIDQ4999479
L. Surel, Olivier Ramaré, S. Ettahri
Publication date: 7 July 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.06808
Related Items (4)
Cyclotomic factors of necklace polynomials ⋮ Accurate computations of Euler products over primes in arithmetic progressions ⋮ Fast multi-precision computation of some Euler products ⋮ Landau and Ramanujan approximations for divisor sums and coefficients of cusp forms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the average number of elements in a finite field with order or index in a prescribed residue class
- Approximation of singular series and automata
- Menon's identity and arithmetical sums representing functions of several variables
- On the Conjecture of Hardy & Littlewood concerning the Number of Primes of the Form n 2 + a
- On Numbers of the Form n 4 + 1
- Representation of integers by cyclotomic binary forms
- On the number of cyclic subgroups of a finite abelian group
- Fast multi-precision computation of some Euler products
- Zeros of recurrence sequences
- The Second-Order Term in the Asymptotic Expansion of B(x)
- Primes of the Form n 4 + 1
- Lal's Constant and Generalizations
- Treue Darstellung Liescher Ringe.
This page was built for publication: Fast multi-precision computation of some Euler products
