Approximation of singular series and automata
From MaRDI portal
Publication:1974143
DOI10.1007/s002290050222zbMath1007.11084MaRDI QIDQ1974143
Publication date: 26 March 2003
Published in: Manuscripta Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002290050222
Hardy-Littlewood circle method; singular series; partial zeta-function; Artin constant; Stephens constant; twin-prime constant
68Q45: Formal languages and automata
11Y60: Evaluation of number-theoretic constants
11Y35: Analytic computations
Related Items
Chebyshev’s bias for composite numbers with restricted prime divisors, A tale of two omegas, Fast multi-precision computation of some Euler products, Cyclotomic factors of necklace polynomials, Unitary cyclotomic polynomials, Some heuristics and results for small cycles of the discrete logarithm, A two-variable Artin conjecture, Cyclotomic coefficients: gaps and jumps, A multiquadratic field generalization of Artin's conjecture, The average least quadratic nonresidue modulo \(m\) and other variations on a theme of Erdős, Representations of analytic functions as infinite products and their application to numerical computations, The formal series Witt transform, On the average number of elements in a finite field with order or index in a prescribed residue class, On gamma quotients and infinite products, Artin's primitive root conjecture for quadratic fields, Graded algebras with cyclotomic Hilbert series, Accurate computations of Euler products over primes in arithmetic progressions, Cyclotomic exponent sequences of numerical semigroups, The Bateman-Horn conjecture: heuristic, history, and applications, Jordan totient quotients, On the least common multiple of several random integers, Entropy and diffraction of the \(k\)-free points in \(n\)-dimensional lattices, Values of the Euler function free of \(k\)th powers, Artin prime producing quadratics, Cyclotomic numerical semigroup polynomials with at most two irreducible factors, Cyclotomic Numerical Semigroups, Computing the Mertens and Meissel–Mertens Constants for Sums over Arithmetic Progressions, On the constant in the Mertens product for arithmetic progressions. II: Numerical values, Roots of unity and nullity modulo $n$