English
Related papers

Related papers: Exceptional characters and prime numbers in sparse…

200 papers

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

Number Theory · Mathematics 2025-11-25 Chenghui Ren

Let $E$ be an elliptic curve defined over a number field $K$. We say that a prime number $p$ is exceptional for $(E,K)$ if $E$ admits a $p$-isogeny defined over $K$. The so-called exceptional set of all such prime numbers is finite if and…

Number Theory · Mathematics 2010-04-28 Nicolas Billerey

We develop a sieve that can detect primes in multiplicatively structured sets under certain conditions. We apply it to obtain a new $L$-function free proof of Linnik's problem of bounding the least prime $p$ such that $p\equiv a\pmod q$…

Number Theory · Mathematics 2024-02-01 Kaisa Matomäki , Jori Merikoski , Joni Teräväinen

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

Number Theory · Mathematics 2015-01-28 Stijn S. C. Hanson

Improving earlier estimates of several authors we show that the number E(X) of Goldbach exceptional even integers (that is, even integers which cannot be written as the sum of two primesw) below X satisfies tho bound E(X) < X^0.72 for…

Number Theory · Mathematics 2018-05-01 Janos Pintz

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

General Mathematics · Mathematics 2023-07-31 Mbakiso Fix Mothebe

A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…

Number Theory · Mathematics 2021-11-11 Xiannan Li

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum $\sum_p a_p$ over primes $p$, where $(a_n)_{x/2<n\le x}$ is an arbitrary non-negative sequence satisfying Type I and Type II…

Number Theory · Mathematics 2024-07-22 Kevin Ford , James Maynard

Let G be a finite non-abelian simple group and let p be a prime. We classify all pairs (G,p) such that the sum of the complex irreducible character degrees of G is greater than the index of a Sylow p-subgroup of G. Our classification…

Group Theory · Mathematics 2013-02-07 Pablo Spiga , Alexandre Zalesski

Under ABC, Silverman showed that there are infinitely many non-Wieferich primes with respect to any (non-trivial) base $a$. Recently Srinivas and Subramani proved an analogous result over number fields with trivial class group. In the first…

Number Theory · Mathematics 2020-02-28 Subham Bhakta

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

Number Theory · Mathematics 2015-10-06 Adrian Dudek , Loïc Grenié , Giuseppe Molteni

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

Number Theory · Mathematics 2015-04-20 Christian Axler

A sieve is constructed for ordinary twin primes of the form 6m+/-1 that are characterized by their twin rank m. It has no parity problem. Non-rank numbers are identified and counted using odd primes p>=5. Twin- and non-ranks make up the set…

General Mathematics · Mathematics 2014-05-14 H. J. Weber

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

Number Theory · Mathematics 2014-02-27 Minoru Fujimoto , Kunihiko Uehara

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

Number Theory · Mathematics 2024-01-22 Gareth A. Jones , Alexander K. Zvonkin

The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…

Number Theory · Mathematics 2014-10-31 Andrew Granville

It is proven that there are infinitely prime pairs whose difference is no greater than 84. In proving that result, a new sieve weight is constructed. The new idea is to construct the largest sieve support which admits the use of the…

Number Theory · Mathematics 2022-08-02 Chunlei Liu

For a prime $p$, we determine a Sylow $p$-subgroup $D$ of a finite group $G$ such that the principal $p$-block $B$ of $G$ has four irreducible ordinary characters. It has been determined already for the cases where the number is up to three…

Representation Theory · Mathematics 2021-08-25 Shigeo Koshitani , Taro Sakurai

Let $G$ be a finite group and $P$ a Sylow $2$-subgroup of $G$. We obtain both asymptotic and explicit bounds for the number of odd-degree irreducible complex representations of $G$ in terms of the size of the abelianization of $P$. To do…

Group Theory · Mathematics 2020-08-28 Nguyen Ngoc Hung , Thomas Michael Keller , Yong Yang

We improve Irving's method of the double-sieve by using the DHR sieve. By extending the upper and lower sieve functions into their respective non-elementary ranges, we are able to make improvements on the previous records on the number of…

Number Theory · Mathematics 2016-06-14 Pin-Hung Kao