English
Related papers

Related papers: Chebyshev's Bias against Splitting and Principal P…

200 papers

We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…

Number Theory · Mathematics 2026-01-06 Mounir Hayani

Prime counting functions are believed to exhibit, in various contexts, discrepancies beyond what famous equidistribution results predict; this phenomenon is known as Chebyshev's bias. Rubinstein and Sarnak have developed a framework which…

Number Theory · Mathematics 2022-04-05 Daniel Fiorilli , Florent Jouve

In this article, we prove that an asymptotic formula for the prime number race with respect to Fermat curves of prime degree is equivalent to part of the Deep Riemann Hypothesis (DRH), which is a conjecture on the convergence of partial…

Number Theory · Mathematics 2024-06-18 Yoshiaki Okumura

We explicate the deep Riemann hypothesis for the general linear group $\mathrm{GL}_{n}$ on the convergence of normalised Euler products of standard $L$-functions on the critical line. It conditionally improves upon the error term in the…

Number Theory · Mathematics 2023-12-19 Ikuya Kaneko , Shin-ya Koyama , Nobushige Kurokawa

In this paper we produce unconditionally new instances of Galois number field extensions exhibiting strong discrepancies in the distribution of Frobenius elements among conjugacy classes of the Galois group. We first prove an inverse Galois…

Number Theory · Mathematics 2024-04-11 Mounir Hayani

We study the inequities in the distribution of Frobenius elements in Galois extensions of the rational numbers with Galois groups that are either dihedral $D_{2n}$ or (generalized) quaternion $\mathbb H_{2n}$ of two-power order. In the…

Number Theory · Mathematics 2021-06-10 Alexandre Bailleul

Under two assumptions, we determine the distribution of the difference between two functions each counting the numbers < x that are in a given arithmetic progression modulo q and the product of two primes. The two assumptions are (i) the…

Number Theory · Mathematics 2012-08-28 Kevin Ford , Jason Sneed

Chebyshev presented a conjecture after observing the apparent bias towards primes congruent to $3\pmod 4$. His conjecture is equivalent to a version of the Generalised Riemann Hypothesis. Fujii strengthened this conjecture; we strengthen it…

Number Theory · Mathematics 2018-02-02 Dave Platt , Tim Trudgian

Chebotarev's density theorem asserts that the prime ideals are equidistributed among the conjugacy classes of the Galois group of any normal extension of number fields. An effective version of this theorem was first established by Lagarias…

Number Theory · Mathematics 2025-08-14 Sourabhashis Das , Habiba Kadiri , Nathan Ng

In this paper we discuss the generalizations of the concept of Chebyshev's bias from two perspectives. First we give a general framework for the study of prime number races and Chebyshev's bias attached to general $L$-functions satisfying…

Number Theory · Mathematics 2019-04-01 Lucile Devin

It is well known that $li(x)>\pi(x)$ (i) up to the (very large) Skewes' number $x_1 \sim 1.40 \times 10^{316}$ \cite{Bays00}. But, according to a Littlewood's theorem, there exist infinitely many $x$ that violate the inequality, due to the…

Number Theory · Mathematics 2013-03-20 Adel Alamadhi , Michel Planat , Patrick Solé

Given a Galois extension $L/K$ of number fields, we describe fine distribution properties of Frobenius elements via invariants from representations of finite Galois groups and ramification theory. We exhibit explicit families of extensions…

Number Theory · Mathematics 2024-05-15 Daniel Fiorilli , Florent Jouve

The effective version of Chebotarev's density theorem under the Generalized Riemann Hypothesis and the Artin conjecture (cf. Iwaniec and Kowalski's Analytic Number Theory, 5.13) involves a numerical invariant of a subset $D$ of a finite…

Number Theory · Mathematics 2013-08-06 Joël Bellaïche

Chebyshev observed in a letter to Fuss that there tends to be more primes of the form $4n+3$ than of the form $4n+1$. The general phenomenon, which is referred to as Chebyshev's bias, is that primes tend to be biased in their distribution…

Number Theory · Mathematics 2016-01-20 Daniel Fiorilli

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

Number Theory · Mathematics 2007-05-23 Pieter Moree , Peter Stevenhagen

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

Number Theory · Mathematics 2021-09-23 Lucile Devin , Xianchang Meng

An old open problem in number theory is whether Chebotarev density theorem holds in short intervals. More precisely, given a Galois extension $E$ of $\mathbb{Q}$ with Galois group $G$, a conjugacy class $C$ in $G$ and an $1\geq…

Number Theory · Mathematics 2024-10-15 Lior Bary-Soroker , Ofir Gorodetsky , Taelin Karidi , Will Sawin

We prove a new effective Chebotarev density theorem for Galois extensions $L/\mathbb{Q}$ that allows one to count small primes (even as small as an arbitrarily small power of the discriminant of $L$); this theorem holds for the Galois…

Number Theory · Mathematics 2020-02-11 Lillian B. Pierce , Caroline L. Turnage-Butterbaugh , Melanie Matchett Wood

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Number Theory · Mathematics 2020-08-04 Maciej P. Wojtkowski

We prove a bound on the number of primes with a given splitting behaviour in a given field extension. This bound generalises the Brun-Titchmarsh bound on the number of primes in an arithmetic progression. The proof is set up as an…

Number Theory · Mathematics 2017-03-10 Korneel Debaene
‹ Prev 1 2 3 10 Next ›