Related papers: Pad\'e approximation for a class of hypergeometric…
We propose a linear independence criterion, and outline an application of it. Down to its simplest case, it aims at solving this problem: given three real numbers, typically as special values of analytic functions, how to prove that the…
In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…
We apply the technique of self-similar exponential approximants based on successive truncations of continued exponentials to reconstruct functional laws of the quasi-exponential class from the knowledge of only a few terms of their power…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
In \cite{5} we proved that generically functions defined in any open set can be approximated by a sequense of their pad\'{e} approximants, in the sense of uniform convergence on compacta. In this paper we examine a more particular space,…
We present a method for constructing global analytical expressions that approximate a function over its entire range. These approximations not only mirror the original function as accurately as desired, but are purposefully created to…
Following earlier results of Sondow, we propose another criterion of irrationality for Euler's constant $\gamma$. It involves similar linear combinations of logarithm numbers $L\_{n,m}$. To prove that $\gamma$ is irrational, it suffices to…
We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…
For a real number $x$, call $\frac1n \lfloor nx \rfloor$ the $n$-th lower rational approximation of $x$. We study the functions defined by taking the cumulative average of the first $n$ lower rational approximations of $x$, which we call…
In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. We also generalize some classical…
We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…
Given a system of functions $\textup{\textbf{F}}=(F_1,\ldots,F_d),$ analytic on a neighborhood of some compact subset $E$ of the complex plane with simply connected complement, we define a sequence of vector rational functions with common…
In some applications, one is interested in reconstructing a function $f$ from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we…
In this paper, we work in the framework of Hilbert-valued Wiener structures and derive a functional version of the second-order Gaussian Poincar\'e inequality that leads to abstract bounds for Gaussian process approximation in $d_2$…
Physically relevant field-theoretic quantities are usually derived from perturbation techniques. These quantities are solved in the form of an asymptotic series in powers of small perturbation parameters related to the physical system, and…
A new algebraic object is introduced - recurrent fractions, which is an n-dimensional generalization of continued fractions. It is used to describe an algorithm for rational approximations of algebraic irrational numbers. Some…
Linear forms in logarithms have an important role in the theory of Diophantine equations. In this article, we prove explicit $p$-adic lower bounds for linear forms in $p$-adic logarithms of rational numbers using Pad\'e approximations of…
The origin of this study is based on not only explicit formulas of finite sums involving higher powers of binomial coefficients, but also explicit evaluations of generating functions for this sums. It should be emphasized that this study…
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
We solve a Pad\'e-type problem of approximating three specific functions simultaneously by $q$-analogues of polylogarithms, respectively by powers of the logarithm. This problem is intimately related to recent results of the authors and…