English
Related papers

Related papers: The $S$-$E$ route to the Chebyshev bounds for the …

200 papers

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…

Number Theory · Mathematics 2013-07-23 Igor E. Pritsker

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

Number Theory · Mathematics 2008-12-16 Chantal David , Jie Wu

We analyze the global convergence of the power iterates for the computation of a general mixed-subordinate matrix norm. We prove a new global convergence theorem for a class of entrywise nonnegative matrices that generalizes and improves a…

Numerical Analysis · Mathematics 2020-02-07 Antoine Gautier , Matthias Hein , Francesco Tudisco

We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was…

Number Theory · Mathematics 2007-05-23 Greg Martin

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

Data Structures and Algorithms · Computer Science 2022-08-30 Nikhil Bansal , Haotian Jiang , Raghu Meka

For any prime $p$, let $y(p)$ denote the smallest integer $y$ such that every reduced residue class $\pmod p$ is represented by the product of some subset of $\{1,\dots,y\}$. It is easy to see that $y(p)$ is at least as large as the…

Number Theory · Mathematics 2021-01-20 Greg Martin , Amir Parvardi

We prove a weighted Carleman estimate for a class of one-dimensional, self-adjoint Schr\"odinger operators $P(h)$ with low regularity electric and magnetic potentials, where $h > 0$ is a semiclassical parameter. The long range part of…

Analysis of PDEs · Mathematics 2025-06-10 Andrés Larraín-Hubach , Jacob Shapiro

In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for…

Number Theory · Mathematics 2026-04-07 Daniel R. Johnston

We investigate gaps of $n$-term arithmetic progressions $x, x+y, \ldots, x+(n-1)y$ inside a positive measure subset $A$ of the unit cube $[0,1]^d$. If lengths of their gaps $y$ are evaluated in the $\ell^p$-norm for any $p$ other than $1,…

Classical Analysis and ODEs · Mathematics 2022-04-27 Polona Durcik , Vjekoslav Kovač

We prove quantitative estimates for averages of the von Mangoldt and M\"obius functions along polynomial progressions $n+P_1(m),\ldots, n+P_k(m)$ for a large class of polynomials $P_i$. The error terms obtained save an arbitrary power of…

Number Theory · Mathematics 2024-10-17 Lilian Matthiesen , Joni Teräväinen , Mengdi Wang

We study the approximation error $\varepsilon(x)=\operatorname{li}_{*}(x)-\operatorname{li}(x)$ arising from the classical Stieltjes asymptotic expansion for the logarithmic integral. Our analysis is based on the discrete values…

Number Theory · Mathematics 2026-01-01 Jonatan Gomez

The purpose of this paper is to revisit the proof of the Gearhardt-Pr\"uss-Hwang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on $\Vert…

Optimization and Control · Mathematics 2021-03-12 Bernard Helffer , Johannes Sjöstrand

$L-$series attached to two classical families of elliptic curves with complex multiplications are studied over number fields, formulae for their special values at $s=1, $ bound of the values, and criterion of reaching the bound are given.…

Number Theory · Mathematics 2015-06-26 Derong Qiu , Xianke Zhang

In this paper, I utilize a variant of the Selberg--Delange method to find quantitative estimates of the sums \[M_{k,\omega}(x,y)=\sum_{\substack{p_{1}(n)> y\\ n\leq x} } \mu(n) {\omega(n)-1\choose k-1},\] where $y$ can grow with $x$ but we…

Number Theory · Mathematics 2026-01-16 Yazan Alamoudi

Let $E$ be an elliptic curve over $\mathbb{Q}.$ Let $a_p$ denote the trace of the Frobenius endomorphism at a rational prime $p$. For a fixed integer $r,$ define the prime-counting function as $\pi_{E,r}(x):=\sum_{p\leq x,p\nmid…

Number Theory · Mathematics 2021-08-16 Hourong Qin

We study Sinkhorn's algorithm for solving the entropically regularized optimal transport problem. Its iterate $\pi_{t}$ is shown to satisfy $H(\pi_{t}|\pi_{*})+H(\pi_{*}|\pi_{t})=O(t^{-1})$ where $H$ denotes relative entropy and $\pi_{*}$…

Optimization and Control · Mathematics 2025-04-08 Promit Ghosal , Marcel Nutz

The prime counting function inequality $\pi(x+y) < \pi(x)+\pi(y)$, which is known as Hardy-Littlewood conjecture, has been established for a variety of cases such as $ \delta x \leq y \leq x$, where $0< \delta \leq 1$, and $x \leq y\leq x…

General Mathematics · Mathematics 2018-08-08 N. A. Carella

We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…

Probability · Mathematics 2020-07-07 Soumik Pal , Ting-Kam Leonard Wong

Given a psh function $\varphi\in\mathcal{E}(\Omega)$ and a smooth, bounded $\theta\geq 0$, it is known that one can solve the Monge-Amp\`{e}re equation $\mathrm{MA}(\varphi_\theta)=\theta^n\mathrm{MA}(\varphi)$, with some form of Dirichlet…

Complex Variables · Mathematics 2024-10-22 Nicholas McCleerey

We obtain hardness of approximation results for the $\ell_p$-Shortest Path problem, a variant of the classic Shortest Path problem with vector costs. For every integer $p \in [2,\infty)$, we show a hardness of $\Omega(p(\log n / \log^2\log…

Data Structures and Algorithms · Computer Science 2025-10-27 Charlie Carlson , Yury Makarychev , Ron Mosenzon