Related papers: Irrationality proof of certain Lambert series usin…
Let $\mathbb N$ be the set of positive integers, and denote by $\lambda(A)=\inf\{t>0:\sum_{a\in A} a^{-t}<\infty\}$ the convergence exponent of $A\subset\mathbb N$. For $0<q\le 1$, $0\le q\le 1$, respectively, the admissible ideals…
We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression.
Consider two series $$\sum_{n=1}^\infty\frac{\sin^n\pi\theta n}{n^\alpha},\quad\sum_{n=1}^\infty\frac{\cos^n\pi\theta n}{n^\alpha}.$$ We show that number-theoretical properties of $\theta$ have a strong effect on the convergence when…
We study metrical properties of various subsequences associated to the sequence of rational approximants coming from the continued fraction of an irrational number. Our methods build upon Bosma, Jager and Wiedijk's proof of the…
When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…
An arithmetic method of proving the irrationality of smooth projective 3-folds is described, using reduction modulo $p$. It is illustrated by an application to a cubic threefold, for which the hypothesis that its intermediate Jacobian is…
We present a new proof of the irrationality of values of the series $T_q(z)=\sum_{n=0}^\infty z^nq^{-n(n-1)/2}$ in both qualitative and quantitative forms. The proof is based on a hypergeometric construction of rational approximations to…
We classify the graphs that can occur as the graph of rational preperiodic points of a quadratic polynomial over $\bold Q$, assuming the conjecture that it is impossible to have rational points of period $4$ or higher. In particular, we…
In this article we consider a method for proving a class of analytical inequalities via minimax rational approximations. All numerical calculations in this paper are given by Maple computer program.
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
We find two series expansions for Legendre's second incomplete elliptic integral $E(\lambda, k)$ in terms of recursively computed elementary functions. Both expansions converge at every point of the unit square in the $(\lambda, k)$ plane.…
The type $\tau$($\alpha$) of an irrational number $\alpha$ measures the extent to which rational numbers can closely approximate $\alpha$. More precisely, $\tau$($\alpha$) is the infimum over those t$\in$R for which…
Previously developed Pade-related method of resummation for QCD observables, which achieves exact renormalization-scale-invariance, is extended so that the scheme-invariance is obtained as well. The dependence on the leading scheme…
The approximate numerical method for a calculation of a quantum wave impedance in a case of a potential energy with a complicated spatial structure is considered. It was proved that the approximation of a real potential by a piesewise…
We study the prime pair counting functions $\pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of…
A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes, stochastic context-free grammars,…
Results in $p$-adic transcendence theory are applied to two problems in the Chabauty-Coleman method. The first is a question of McCallum and Poonen regarding repeated roots of Coleman integrals. The second is to give lower bounds on the…
By applying the Euler--Rayleigh methods to a specific representation of the Jacobi polynomials as hypergeometric functions, we obtain new bounds for their largest zeros. In particular, we derive upper and lower bound for…
We construct a sieve that enumerates rational ``imbalances'' of the form $(p-q)/(p+q)$ for integers $p\ge2$ and $1\le q<p$, ordered lexicographically by $(p,q)$. Each imbalance is reduced to lowest terms, and we record the sequence of…
We introduce a modification to the patchy method of Navasca and Krener for solving the stationary Hamilton Jacobi Bellman equation. The numerical solution that we generate is a set of polynomials that approximate the optimal cost and…