Related papers: On error sums formed by rational approximations wi…

The classical continued fraction is generalized for studying the rational approximation problem on multi-formal Laurent series in this paper, the construction is called m-continued fraction. It is proved that the approximants of an…

A fundamental question in computer science is: Is it harder to solve $n$ instances independently than to solve them simultaneously? This question, known as the direct sum question or direct sum theorem, has been paid much attention in…

It is widely believed that the continued fraction expansion of every irrational algebraic number $\alpha$ either is eventually periodic (and we know that this is the case if and only if $\alpha$ is a quadratic irrational), or it contains…

In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function…

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…

Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.

We consider large values of long linear exponential sums involving Fourier coefficients of holomorphic cusp forms. The sums we consider involve rational linear twists $e(nh/k)$ with sufficiently small denominators. We prove both pointwise…

In this paper we consider fractional quasi-Bessel equations $$\sum_{i=1}^{m}d_i x^{\alpha_i+p_i}D^{\alpha_i} u(x) + (x^\beta - \nu^2)u(x)=0$$ and construct their existence and uniqueness theory in the class of fractional series. Our…

By using a jump transformation associated to the Romik map, we define a new continued fraction algorithm called odd-odd continued fraction, whose principal convergents are rational numbers of odd denominators and odd numerators. Among…

It is well known that if $0.a_1a_2a_3\dots$ is the base-$b$ expansion of a number normal to base-$b$, then the numbers $0.a_ka_{m+k}a_{2m+k}\dots$ for $m\ge 2$, $k\ge 1$ are all normal to base-$b$ as well. In contrast, given a continued…

Motivated by recent results, we study sums of the form $S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor \right)$, where $f$ is an arithmetic function and $\left\lfloor\cdot\right\rfloor$ denotes the greatest integer…

Uniform asymptotic expansions are derived for the zeros of the reverse generalized Bessel polynomials of large degree $n$ and real parameter $a$. It is assumed that $-\Delta_{1} n+\frac{3}{2} \leq a \leq \Delta_{2} n$ for fixed arbitrary…

Sums of the form $\sum_{q \leq N_1 < \cdots < N_m \leq n}{a_{(m);N_m}\cdots a_{(2);N_2}a_{(1);N_1}}$ date back to the sixteen century when Vi\`ete illustrated that the relation linking the roots and coefficients of a polynomial had this…

The class of Lambert series generating functions (LGFs) denoted by $L_{\alpha}(q)$ formally enumerate the generalized sum-of-divisors functions, $\sigma_{\alpha}(n) = \sum_{d|n} d^{\alpha}$, for all integers $n \geq 1$ and fixed real-valued…

We introduced a new continued fraction expansions in our previous paper. For these expansions, we show formulae of probability about incomplete quotients. Furthermore, we prove the existence of invariant measures with respect to the…

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Approximate Bayesian Computation (ABC) is a popular computational method for likelihood-free Bayesian inference. The term "likelihood-free" refers to problems where the likelihood is intractable to compute or estimate directly, but where it…

Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…

We prove sharp, computable error estimates for the propagation of errors in the numerical solution of ordinary differential equations. The new estimates extend previous estimates of the influence of data errors and discretisation errors…