The Gelfond–Schnirelman Method in Prime Number Theory

DOI10.4153/CJM-2005-041-8zbMATH Open1153.11329arXiv1307.5361MaRDI QIDQ3370690FDOQ3370690

Igor E. Pritsker

Publication date: 8 February 2006

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

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.

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

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

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)

Cited In (10)

• Polynomials with integer coefficients and their zeros
• Title not available (Why is that?)
• The multivariate integer Chebyshev problem
• Polynomials with integer coefficients of small norms
• Small polynomials with integer coefficients
• A note on integer polynomials with small integrals. II
• How to find a measure from its potential
• The so-called renormalization group method applied to the specific prime numbers logarithmic decrease
• Constrained extremal problems for the difference product
• Title not available (Why is that?)

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)