Related papers: On rational approximation of algebraic functions
We represent the generalized Collatz function with the recursive ruler function r(2n) = r(n) + 1 and r(2n + 1) = 1. We generate even-only and odd-only Collatz subsequences that contain significantly fewer elements term by term, to 2 and 1,…
We present a new simple algorithm for efficient, and relatively accurate computation of the Faddeyeva function w(z). The algorithm carefully exploits previous approximations by Hui et al [1978] and Humlicek [1982] along with asymptotic…
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
We show that suitably regular functions can be approximated in the $\mathcal{C}^1$-norm both with rational functions and rational neural networks, including approximation rates with respect to width and depth of the network, and degree of…
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a…
We introduce and survey results on two families of zeta functions connected to the multiplicative and additive theories of integer partitions. In the case of the multiplicative theory, we provide specialization formulas and results on the…
In this article, we explore a natural extension of the quadratic parametrization introduced in our previous work. By replacing the integer $n$ by $n^s$ ($ s\in\mathbb{R}, s>1$) and allowing the parameters to be real, we obtain for each…
In this paper we introduce an equivalence relation on the classes of almost periodic functions of a real or complex variable which is used to refine Bochner's result that characterizes these spaces of functions. In fact, with respect to the…
In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set defined by finitely many polynomial inequalities. More…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…
For functions defined via Dirichlet/generalized Dirichlet series in some half planes of the complex plane, we give a new simple elementary approach to obtain an Approximate Functional Equation(AFE for short) for the product of functions…
In \cite{d4}, we gave a method to construct a continued fraction of the function $F(x):=e^{x}E_{1}(x)$. More precisely we define $F_{1}(x)$ as the reciprocal of $F(x)$ and we inductively define $F_{m}(x)$ as the reciprocal of ``$F_{m-1}(x)$…
The paper proves sum-of-square-of-rational-function based representations (shortly, sosrf-based representations) of polynomial matrices that are positive semidefinite on some special sets: $\mathbb{R}^n;$ $\mathbb{R}$ and its intervals…
We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models for high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process…
Let $I_n(x)=\prod_{i=1}^n \left( 1+x^{F_{i+1}}\right)$, where $F_{i+1}$ denotes a Fibonacci number. Let $v_r(n)$ denote the sum of the $r$th powers of the coefficients of $I_n(x)$. Our prototypical result is that $\sum_{n\geq 0} v_2(n)x^n=…
We construct a family of iterations for computing the principal square root of a square matrix $A$ using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing…
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…
The present paper analyzes the discrepancy of distribution of rational points on general semisimple algebraic group varieties. The results include mean-square, almost sure, and uniform discrepancy estimates with explicit error bounds, which…
The properties of the Wilson rational functions ${}_{10}\phi_9$ with three different normalizations are described. For one normalization, it satisfies an $R_{II}$ recurrence relation, whereas for the two other ones, they satisfy a…