中文
相关论文

相关论文: Explicit Calculations for Sono's Multidimensional …

200 篇论文

We exhibit a new application of two dimensional covering systems, examples of integer pairs $a,b$ for which $a^m-b^n$ has a prime divisor from some given finite set of primes, for every pair of integers $m,n\geq 0$. This leads us to…

数论 · 数学 2026-04-14 Andrew Granville , Francesco Pappalardi

We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form $\lambda^{s_n}$. In particular, we obtain a result which is…

数论 · 数学 2017-07-18 Mei-Chu Chang , Bryce Kerr , Igor E. Shparlinski

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

数论 · 数学 2025-07-01 Alexandru Pascadi

We consider the probability of two large gaps (intervals without eigenvalues) in the bulk scaling limit of the Gaussian Unitary Ensemble of random matrices. We determine the multiplicative constant in the asymptotics. We also provide the…

数学物理 · 物理学 2020-03-19 Benjamin Fahs , Igor Krasovsky

A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd…

数论 · 数学 2012-04-25 H. J. Weber

For a prime number $p$, we consider its primorial $P:=p\#$ and $U(P):={\left(\mathbb{Z}/P\mathbb{Z}\right)}^\times$ the set of elements of the multiplicative group of integers modulo $P$ which we represent as points anticlockwise on a…

数论 · 数学 2023-12-12 Steven Brown

We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…

综合数学 · 数学 2015-08-11 Jens Oehlschlägel

Multiplication is an essential step in a lot of calculations. In this paper we look at multiplication of 2 binary polynomials of degree at most $n-1$, modulo an irreducible polynomial of degree $n$ with $2n$ input and $n$ output qubits,…

量子物理 · 物理学 2020-02-27 Iggy van Hoof

We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…

数论 · 数学 2018-01-04 Hugues Randriam

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…

数论 · 数学 2026-05-05 Junyi Chu , Jinjiang Li , Min Zhang

Let $a_0\in\{0,\dots,9\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their decimal expansion. The proof is an application of the Hardy-Littlewood circle method to a binary problem, and rests on…

数论 · 数学 2019-10-30 James Maynard

We develop a lower bound sieve for primes under the (unlikely) assumption of infinitely many exceptional characters. Compared with the illusory sieve due to Friedlander and Iwaniec which produces asymptotic formulas, we show that less…

数论 · 数学 2024-06-19 Jori Merikoski

We deduce explicit formulae for the intrinsic volumes of an ellipsoid in $\mathbb R^d$, $d\ge 2$, in terms of elliptic integrals. Namely, for an ellipsoid ${\mathcal E}\subset \mathbb R^d$ with semiaxes $a_1,\ldots, a_d$ we show that…

度量几何 · 数学 2022-07-14 Anna Gusakova , Evgeny Spodarev , Dmitry Zaporozhets

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

数论 · 数学 2012-01-27 Angel Kumchev , Taiyu Li

We take an approach toward counting the number of n for which the curves E_n: y^2=x^3-n^2x have 2-Selmer groups of a given size. This question was also discussed in a pair of Invent. Math. papers by Roger Heath-Brown. We discuss the…

数论 · 数学 2007-07-02 Robert C. Rhoades

What is the maximum number of holes enclosed by a $d$-dimensional polyomino built of $n$ tiles? Represent this number by $f_d(n)$. Recent results show that $f_2(n)/n$ converges to $1/2$. We prove that for all $d \geq 2$ we have $f_d(n)/n…

组合数学 · 数学 2022-08-01 Greg Malen , Fedor Manin , Erika Roldan

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

计算复杂性 · 计算机科学 2007-05-23 Vince Grolmusz

The probabilities for gaps in the eigenvalue spectrum of the finite dimension $ N \times N $ random matrix Hermite and Jacobi unitary ensembles on some single and disconnected double intervals are found. These are cases where a reflection…

数学物理 · 物理学 2009-10-31 N. S. Witte , P. J. Forrester , Christopher M. Cosgrove

The Selberg sieve provides majorants for certain arithmetic sequences, such as the primes and the twin primes. We prove an L^2-L^p restriction theorem for majorants of this type. An immediate application is to the estimation of exponential…

数论 · 数学 2007-05-23 Ben Green , Terence Tao

We prove several supercongruences involving the harmonic number of order two $H_n^{(2)}:=\sum_{k=1}^n1/k^2$. For example, if $p>5$ is prime and $\alpha$ is $p$-integral, then we can completely determine $$…

数论 · 数学 2022-01-19 Guo-Shuai Mao , Hao Pan