The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible.
We prove that under a restriction on the characteristic of the finite field Fq and a smoothness assumption, finitely many irreducible polynomials in one variable over the ring Fq[t] assume simultaneous prime values after a sufficiently large extension of the field of constants.
We resolve Schinzel's Hypothesis (H) for $100\%$ of polynomials of arbitrary degree. We deduce that a positive proportion of diagonal conic bundles over $\mathbb{Q}$ with any given number of degenerate fibres have a rational point, and obtain similar results for generalised Châtelet equations.
The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is replaced by a polynomial ring and prove the Schinzel hypothesis for a wide class of them: polynomials in at least one variable over the integers, polynomials in several variables over an arbitrary field, etc. We achieve this goal by developing a version over rings of the Hilbert specialization property. A polynomial Goldbach conjecture is deduced, along with …
The Schinzel Hypothesis is a conjecture about irreducible polynomials in one variable over the integers: under some standard condition, they should assume infinitely many prime values at integers. We consider a relative version: if the polynomials are relatively prime and no prime number divides all their values at integers, then they assume relatively prime values at at least one integer. We extend the question to all integral domains and prove it for a number of them: PIDs, UFDs containing an infinite field, polynomial rings over a UFD. Applications include a new "integral" version of the Hi…
Assuming Dickson's conjecture, we obtain multidimensional analogues of recent results on the behavior of certain multiplicative arithmetic functions near twin-prime arguments. This is inspired by analogous unconditional theorems of Schinzel undertaken without primality assumptions.
We establish a version "over the ring" of the celebrated Hilbert Irreducibility Theorem. Given finitely many polynomials in $k+n$ variables, with coefficients in $\mathbb Z$, of positive degree in the last $n$ variables, we show that if they are irreducible over $\mathbb Z$ and satisfy a necessary "Schinzel condition", then the first $k$ variables can be specialized in a Zariski-dense subset of ${\mathbb Z}^k$ in such a way that irreducibility over ${\mathbb Z}$ is preserved for the polynomials in the remaining $n$ variables. The Schinzel condition, which comes from the Schinzel Hypothesis, is…
The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this coprime version of the Schinzel Hypothesis: under some natural assumption, coprime polynomials assume coprime values at infinitely many integers. Consequences include a version "modulo an integer" of the original Schinzel Hypothesis, with the Goldbach conjecture, again modulo an integer, as a special case.
Given a number field $k$ and a positive integer $n$, there exists an algebraic variety $X$ over $k$ and a function $f$ on $X$ whose set of values $f(X(k))$ on the set of $k$-points of $X$ is the complement in $k$ of the set of $n$-th powers. This result had been proved by B. Poonen (2009) for $n$ a power of $2$. For $n$ arbitrary, under Schinzel's hypothesis, it has been given a conditional proof by T. Várilly-Alvarado and B. Viray (2012). Instead of Schinzel's hypothesis, we use "Salberger's trick", as developed in papers of Skorobogatov, Swinnerton-Dyer and one of the authors.
Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of this conjecture for polynomial rings over pseudo algebraically closed fields. This implies results over large finite fields. A main tool in the proof is an irreducibility theorems à la Hilbert.
Schinzel's Hypothesis (H) was used by Colliot-Thélène and Sansuc, and later by Serre, Swinnerton-Dyer and others, to prove that the Brauer-Manin obstruction controls the Hasse principle and weak approximation on pencils of conics and similar varieties. We show that when the ground field is Q and the degenerate geometric fibres of the pencil are all defined over Q, one can use these methods to obtain unconditional results by replacing Hypothesis (H) with the finite complexity case of the generalised Hardy-Littlewood conjecture recently established by Green, Tao and Ziegler.
Robin's criterion states that the Riemann hypothesis is equivalent to $σ(n) < e^γn \log\log n$ for all integers $n \geq 5041$, where $σ(n)$ is the sum of divisors of $n$ and $γ$ is the Euler-Mascheroni constant. We prove that the Riemann hypothesis is equivalent to the statement that $σ(n) < \frac{e^γ}{2} n \log\log n$ for all odd numbers $n \geq 3^4 \cdot 5^3 \cdot 7^2 \cdot 11 \cdots 67$. Lagarias's criterion for the Riemann hypothesis states that the Riemann hypothesis is equivalent to $σ(n) < H_n + \exp{H_n}\log{H_n}$ for all integers $n \geq 1$, where $H_n$ is the $n$th harmonic number. W…
We derive the Hasse principle and weak approximation for pencils of certain varieties in the spirit of work by Colliot-Thélène,Sansuc and Harpaz-Skorobogatov-Wittenberg. Our varieties are defined through polynomials in many variables and part of our work is devoted to establishing Schinzel's hypothesis for polynomials of this kind. This last part is achieved by using arguments behind Birch's well-known result regarding the Hasse principle for complete intersections with the notable difference that we prove our result in 50% fewer variables than in the classical Birch setting. We also study the…
In 1999, Iwan Duursma defined the zeta function for a linear code as a generating function of its Hamming weight enumerator. It can also be defined for other homogeneous polynomials not corresponding to existing codes. If the homogeneous polynomial is invariant under the MacWilliams transform, then its zeta function satisfies a functional equation and we can formulate an analogue of the Riemann hypothesis. As far as existing codes are concerned, the Riemann hypothesis is believed to be closely related to the extremal property. In this article, we show there are abundant polynomials invariant b…
The authors assume the Deep Riemann Hypothesis to prove that a weighted sum of Ramanujan's $τ$-function has a bias to being positive. This phenomenon is an analogue of Chebyshev's bias.
We give a number field analogue of a result of Ramanujan, Hardy and Littlewood, thereby obtaining a modular relation involving the non-trivial zeros of the Dedekind zeta function. We also provide a Riesz-type criterion for the Generalized Riemann Hypothesis for $ζ_K(s)$. New elegant transformations are obtained when $K$ is a quadratic extension, one of which involves the modified Bessel function of the second kind.
There have been a number of recent works on the theory of period polynomials and their zeros. In particular, zeros of period polynomials have been shown to satisfy a "Riemann Hypothesis" in both classical settings and for cohomological versions extending the classical setting to the case of higher derivatives of $L$-functions. There thus appears to be a general phenomenon behind these phenomena. In this paper, we explore further generalizations by defining a natural analogue for Hilbert modular forms. We then prove that similar Riemann Hypotheses hold in this situation as well.
There exist small perturbations of L-functions, satisfying the appropriate functional equation, for which the analogue of the Riemann hypothesis fails radically. Moreover, this phenomenon is generic. However, there also exist small perturbations, for which the analogue of the Riemann hypothesis holds.
We study the $q$-analogue of the average of Montgomery's function $F(α, T)$ over bounded intervals. Assuming the Generalized Riemann Hypothesis for Dirichlet $L$-functions, we obtain upper and lower bounds for this average over an interval that are quite close to the pointwise conjectured value of 1. To compute our bounds, we extend a Fourier analysis approach by Carneiro, Chandee, Chirre, and Milinovich, and apply computational methods of non-smooth programming.
We use a function field analogue of a method of Selberg to derive an asymptotic formula for the number of (square-free) monic polynomials in $\mathbb{F}_q[X]$ of degree $n$ with precisely $k$ irreducible factors, in the limit as $n$ tends to infinity. We then adapt this method to count such polynomials in arithmetic progressions and short intervals, and by making use of Weil's `Riemann hypothesis' for curves over $\mathbb{F}_q$, obtain better ranges for these formulae than are currently known for their analogues in the number field setting. Finally, we briefly discuss the regime in which $q$ t…
We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too sparse, and we use it to compute the logarithm of the maximum of the divisor function at every degree up to an error of a constant, which is significantly smaller than in the case of the integers, even assuming the Riemann Hypothesis.
