Related papers: Effective de la Valle Poussin style bounds on the …
We study the optimal general rate of convergence of the n-point quadrature rules of Gauss and Clenshaw-Curtis when applied to functions of limited regularity: if the Chebyshev coefficients decay at a rate O(n^{-s-1}) for some s > 0,…
This paper proposes new bounds for Marcum Q-function, which prove extremely tight and outperform all the bounds previously proposed in the literature. What is more, the proposed bounds are good and stable both for large values and small…
We present a constructive lower bound of $\Omega(1/\sqrt{\varepsilon})$ for Frank-Wolfe (FW) when both the objective and the constraint set are smooth and strongly convex, showing that the known uniform $\mathcal{O}(1/\sqrt{\varepsilon})$…
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…
We provide an upper bound on the efficient irrationality exponents of cubic algebraics $x$ with the minimal polynomial $x^3 - tx^2 - a$. In particular, we show that it becomes non-trivial, i.e. better than the classical bound of Liouville…
We give explicit upper bounds for the coefficients of arbitrary weight $k$, level 2 cusp forms, making Deligne's well-known $O(n^{\frac{k-1}{2}+\epsilon})$ bound precise. We also derive asymptotic formulas and explicit upper bounds for the…
This is an exposition of a theorem due to Chevalley (1951) and Bass (1965). Let $K$ be a finitely generated field. Then there exists a positive integer $\Lambda$, depending only on $K$, such that for every positive integer $n$ the following…
For $d > 1$ a cubefree rational integer, we define an $L$-function (denoted $L_d(s)$) whose coefficients are derived from the cubic theta function for $\mathbb Q\left(\sqrt{-3}\right)$. The Dirichlet series defining $L_d(s)$ converges for…
Using the same heuristic argument leading to the Lang-Waldschmidt Conjecture in the theory of linear forms in logarithms, we formulate an effective version of the Linear Independence conjecture for the ordinates of the non-trivial zeros of…
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly independent functions on an interval $[a,b]$. A general theory of Chebyshev sets guarantees the existence of rules with a Gaussian property, in…
The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…
When solving differential equations by a spectral method, it is often convenient to shift from Chebyshev polynomials $T_{n}(x)$ with coefficients $a_{n}$ to modified basis functions that incorporate the boundary conditions. For homogeneous…
Ordinary differential equations and boundary value problems arise in many aspects of mathematical physics. Chebyshev differential equation is one special case of the Sturm-Liouville boundary value problem. Generating function, recursive…
We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…
We establish analogs of Cheeger's inequality for probability measures with heavy tails. As one of the principal applications, suppose $\lambda > 3$ and define the (Pareto) probability measure $\mu_{\lambda}$ on $[1,\infty)$ by…
This paper provides a detailed expository and computational account of the elementary methods developed by P. L. Chebyshev and J. J. Sylvester to establish explicit bounds on the prime counting function. The core of the method involves…
The $k$th Dickson polynomial of the first kind, $D_k(x) \in {\mathbb Z}[x]$, is determined by the formula: $D_k(u+1/u) = u^k + 1/u^k$, where $k \ge 0$ and $u$ is an indeterminate. These polynomials are closely related to Chebyshev…
For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was…
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…
Lagarias, Montgomery, and Odlyzko proved that there exists an effectively computable absolute constant $A_1$ such that for every finite extension $K$ of ${\mathbb{Q}}$, every finite Galois extension $L$ of $K$ with Galois group $G$ and…