The Gelfond–Schnirelman Method in Prime Number Theory

DOI10.4153/CJM-2005-041-8MaRDI QIDQ3370690zbMATHFDO

Authors Igor E. Pritsker

Publication date 8 February 2006

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.5361

zbMATH Keywords

polynomialspotentialsdistribution of prime numbersweighted capacityweighted transfinite diameterinteger, coefficients

Mathematics Subject Classification ID

Distribution of primes (11N05) Potentials and capacity, harmonic measure, extremal length and related notions in two dimensions (31A15)

Abstract: The original Gelfond-Schnirelman method, proposed in 1936, uses polynomials with integer coefficients and small norms on $[0,1]$ to give a Chebyshev-type lower bound in prime number theory. We study a generalization of this method for polynomials in many variables. Our main result is a lower bound for the integral of Chebyshev's $psi$-function, expressed in terms of the weighted capacity. This extends previous work of Nair and Chudnovsky, and connects the subject to the potential theory with external fields generated by polynomial-type weights. We also solve the corresponding potential theoretic problem, by finding the extremal measure and its support.

Recommendations

• The prime number theorem via the large sieve
• Tauberian theorems and elementary prime number theory
• A spectral interpretation for the explicit formula in the theory of prime numbers
• Giuga's primality conjecture for number fields
• Szemerédi's Theorem in the Primes
• scientific article; zbMATH DE number 5057403
• THE 'LARGE SIEVE' METHOD AND ITS APPLICATIONS IN THE THEORY OF NUMBERS
• On the prime number theorem for the Selberg class
• On the Pjateckii-Sapiro Prime Number Theorem

Cited in

(12)

• Constrained extremal problems for the difference product
• Polynomials with integer coefficients of small norms
• How to find a measure from its potential
• A note on integer polynomials with small integrals. II
• The so-called renormalization group method applied to the specific prime numbers logarithmic decrease
• Distribution of primes and a weighted energy problem
• Polynomials with integer coefficients and their zeros
• scientific article; zbMATH DE number 3871473 (Why is no real title available?)
• On lower bounds for the Chebyshev function in the Gel'fond-Shnirel'man method
• Small polynomials with integer coefficients
• scientific article; zbMATH DE number 5057403 (Why is no real title available?)
• The multivariate integer Chebyshev problem

This page was built for publication: The Gelfond–Schnirelman Method in Prime Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370690)