Related papers: An amusing sequence of functions
By telescoping method, Sun gave some hypergeometric series whose sums are related to $\pi$ recently. We investigate these series from the point of view of Gosper's algorithm. Given a hypergeometric term $t_k$, we consider the Gosper…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in…
In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…
A sequence of rational points on an algebraic planar curve is said to form an $r$-geometric progression sequence if either the abscissae or the ordinates of these points form a geometric progression sequence with ratio $r$. In this work, we…
This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…
For an irrational number $\alpha\in\mathbb{R}$ we consider its irrationality measure function $$ \psi_\alpha(x) = \min_{1\le q\le x,\, q\in\mathbb{Z}} \| q\alpha \|. $$ It is known for all irrational numbers $\alpha$ and $\beta$ satisfying…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
Let $K$ be a number field and $f: \mathbb{P}^1 \to \mathbb{P}^1$ a rational map of degree $d \geq 2$ with at most $s$ places of bad reduction, where we include all archimedean places. We prove that there exists constants $c_1,c_2 > 0$,…
In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…
If we cannot obtain all terms of a series, or if we cannot sum up a series, we have to turn to the partial sum approximation which approximate a function by the first several terms of the series. However, the partial sum approximation often…
The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios…
A $K$-Fibonacci sequence is a binary recurrence sequence where $F_0=0$, $F_1=1$, and $F_n=K\cdot F_{n-1}+F_{n-2}$. These sequences are known to be periodic modulo every positive integer greater than $1$. If the length of one shortest period…
We consider dynamical systems $(X,T,\mu)$ which have exponential decay of correlations for either H\"older continuous functions or functions of bounded variation. Given a sequence of balls $(B_n)_{n=1}^\infty$, we give sufficient conditions…
We give a variant of Basu-Hildebrand-Molinaro's approximation theorem for continuous minimal valid functions for Gomory-Johnson's infinite group problem by piecewise linear two-slope extreme functions [Minimal cut-generating functions are…
A landmark result from rational approximation theory states that $x^{1/p}$ on $[0,1]$ can be approximated by a type-$(n,n)$ rational function with root-exponential accuracy. Motivated by the recursive optimality property of Zolotarev…
In this paper we find the formula that gives the n-th smallest term in a given finite sequence of real numbers.
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…