English
Related papers

Related papers: Effective exponential bounds on the prime gaps

200 papers

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are…

Number Theory · Mathematics 2018-05-15 Paolo Leonetti , Salvatore Tringali

We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…

Number Theory · Mathematics 2018-11-05 Igor E. Shparlinski , Jose Felipe Voloch

We introduce the weighted prime sum $S(x) = \sum_{p \le x} \sqrt{(\log p)/p}$ and the derived quantity $E(x) = S(x)^2 - M(x)$, where $M(x) = \sum_{p \le x} (\log p)/p$. We prove that the order-of-magnitude estimate $S(x) \asymp \sqrt{x /…

General Mathematics · Mathematics 2026-04-27 Kai Hubbard

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Symbolic Computation · Computer Science 2013-06-19 Marc Mezzarobba , Bruno Salvy

The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…

Mathematical Physics · Physics 2008-11-18 D H Gebremedhin , C A Weatherford , X Zhang , A Wynn , G Tanaka

An effective radius of convergence is defined and computed for any truncated Taylor series. Applications to well known series are performed and is shown that a range of good coincidence for actual and approximative plot can always be found.…

Functional Analysis · Mathematics 2013-12-10 Demetris T. Christopoulos

95 years ago Hoheisel proved the existence of primes in the sub-linear interval \[ \left[x, x+x^{1-{1\over 33000}}\right] \qquad \hbox{for $x$ sufficiently large}. \] This was improved by Heilbronn, proving existence of primes in the…

Number Theory · Mathematics 2025-08-29 Matt Visser

In this article, we obtain effective estimates for the error term $\Delta_{k}(x)$ for all integers $k \geq2$, and completely explicit estimates for integers $k \in [3,9]$. The explicit results improve the powers of $x$ appearing in the…

Number Theory · Mathematics 2026-03-18 Neea Palojärvi , Sebastian Tudzi

We provide two new bounds on the number of visible points on exponential curves modulo a prime for all choices of primes. We also provide one new bound on the number of visible points on exponential curves modulo a prime for almost all…

Number Theory · Mathematics 2017-10-17 Simon Macourt

Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For…

Numerical Analysis · Mathematics 2016-11-29 Kathrin Glau , Mirco Mahlstedt

An a posteriori estimate for the error of a standard Krylov approximation to the matrix exponential is derived. The estimate is based on the defect (residual) of the Krylov approximation and is proven to constitute a rigorous upper bound on…

Numerical Analysis · Mathematics 2020-02-03 Tobias Jawecki , Winfried Auzinger , Othmar Koch

The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…

Information Theory · Computer Science 2025-11-13 Andreas Theocharous , Lampros Gavalakis , Ioannis Kontoyiannis

The well-known von Bahr--Esseen bound on the absolute $p$th moments of martingales with $p\in(1,2]$ is extended to a large class of moment functions, and now with a best possible constant factor (which depends on the moment function). This…

Probability · Mathematics 2017-01-17 Iosif Pinelis

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

Number Theory · Mathematics 2021-03-11 Johannes Schleischitz

The aim of this note is to provide an upper bound of the number of positive integers $\le x$ which can be written as $\varphi(n)$ for some positive integer $n$, where $\varphi$ stands for the Euler's function. The order of magnitude of this…

Number Theory · Mathematics 2015-10-07 Paolo Leonetti

The purpose of this article is to further explore how the structure of the affine group can be used to deduce new incidence theorems, and to explore sum-product type applications of these incidence bounds, building on the recent work of…

Combinatorics · Mathematics 2019-05-10 Oliver Roche-Newton , Audie Warren

We give upper bounds for triples of subsets of a finite group such that the triples of elements that multiply to 1 form a perfect matching. Our bounds are the first to give exponential savings in powers of an arbitrary finite group.…

Combinatorics · Mathematics 2017-02-06 Will Sawin

In this work a sharp bound of the \v{C}eby\v{s}ev functional for absolutely continuous functions $f,g$ whose derivatives $f'\in L_{\infty}[a,b]$ and $g'\in L_{1}[a,b]$ is obtained.

Classical Analysis and ODEs · Mathematics 2023-08-07 Mohammad W. Alomari

The one loop effects of two dimension-six operators on gauge boson self energies are computed within an effective field theory framework. These self energies are translated into effects on precision electroweak observables, and bounds are…

High Energy Physics - Phenomenology · Physics 2015-06-15 Harrison Mebane , Nicolas Greiner , Cen Zhang , Scott Willenbrock

We provide completely effective error estimates for Stirling numbers of the first and second kind, denoted by $s(n,m)$ and $S(n,m)$, respectively. These bounds are useful for values of $m \geq n - O(\sqrt{n})$. An application of our Theorem…

Combinatorics · Mathematics 2016-09-12 Richard Arratia , Stephen DeSalvo