Related papers: Lower rational approximations and Farey staircases
We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…
Under certain mild conditions, some limit theorems for functionals of two independent Gaussian processes are obtained. The results apply to general Gaussian processes including fractional Brownian motion, sub-fractional Brownian motion and…
Given a vector function ${\bf 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 denominator in…
Sometimes we obtain attractive results when associating facts to simple elements. The goal of this work is to introduce a possible alternative in the study of the dynamics of rational maps.
This is a continuation of our earlier paper \cite{PT3}. We consider here operator-valued functions (or infinite matrix functions) on the unit circle $\T$ and study the problem of approximation by bounded analytic operator functions. We…
Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…
Let $X$ be a positive integer and $t$ a real number great than 1. The family of sets $\left\{\big\lfloor\frac{X}{n^t}\big\rfloor ~:~ 1\leq n\leq X\right\}$ have an interesting prime distribution property. We give an exact formula for the…
A simple analytic expression for the non-singlet structure function $f_{NS}$ is given. The expression is derived from the result of Ref. [1] obtained by low $x$ resummation of the quark ladder diagrams in the double logarithmic…
Potential theory for rational approximation is reviewed by means of examples computed with the AAA algorithm.
We consider the transform from sequences to triangular arrays defined in terms of generating functions by f(x) -> (1-x)/(1-xy) f(x(1-x)/(1-xy)). We establish a criterion for the transform of a nonnegative sequence to be nonnegative, and we…
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…
Fracterms are introduced as a proxy for fractions. A precise definition of fracterms is formulated and on that basis reasonably precise definitions of various classes of fracterms are given. In the context of the meadow of rational numbers…
We relate a previous result of ours on families of Diophantine equations having only trivial solutions with a result on the approximation of an algebraic number by products of rational numbers and units. We compare this approximation with a…
This paper considers the problem of minimizing the ordered weighted average (or ordered median) function of finitely many rational functions over compact semi-algebraic sets. Ordered weighted averages of rational functions are not, in…
We consider approximation by functions with finite support and characterize its approximation spaces in terms of interpolation spaces and Lorentz spaces.
Our goal is to develop a partial ordering method for comparing stochastic choice functions on the basis of their individual rationality. To this end, we assign to any stochastic choice function a one-parameter class of deterministic choice…
We axiomatically define a cardinal social inefficiency function, which, given a set of alternatives and individuals' vNM preferences over the alternatives, assigns a unique number -- the social inefficiency -- to each alternative. These…
We determine sufficient conditions under which certain recursively defined functions are well defined for all real inputs. Given a function $f:\mathbb R\to\mathbb R$, call a decreasing sequence $x_1>x_2>x_3>\cdots$ "$f$-bad" if…
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…
The $\Sopfr(n)$ function is defined as the sum of prime factors of $n$ each of which is taken with its multiplicity. This function is studied numerically. The analogy between $\Sopfr(n)$ and the primes distribution function is drawn and…