English
Related papers

Related papers: On rational approximation of algebraic functions

200 papers

It is possible to generalize the fruitful interaction between (real or complex) Jacobi matrices, orthogonal polynomials and Pade approximants at infinity by considering rational interpolants, (bi-)orthogonal rational functions and linear…

Classical Analysis and ODEs · Mathematics 2010-02-03 Bernhard Beckermann , Maxim Derevyagin , Alexei Zhedanov

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

Classical Analysis and ODEs · Mathematics 2010-03-29 Markus Mueller , Dierk Schleicher

We present the Polar framework for fully automating the analysis of classical and probabilistic loops using algebraic reasoning. The central theme in Polar comes with handling algebraic recurrences that precisely capture the loop semantics.…

Programming Languages · Computer Science 2026-02-17 Marcel Moosbrugger , Julian Müllner , Ezio Bartocci , Laura Kovács

This work is motivated by problems on simultaneous Diophantine approximation on manifolds, namely, establishing Khintchine and Jarnik type theorems for submanifolds of R^n. These problems have attracted a lot of interest since Kleinbock and…

Number Theory · Mathematics 2016-04-01 Victor Beresnevich

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Logic · Mathematics 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki

We consider the problem of Diophantine approximation on semisimple algebraic groups by rational points with restricted numerators and denominators and establish a quantitative approximation result for all real points in the group by…

Dynamical Systems · Mathematics 2014-11-04 Alexander Gorodnik , Shirali Kadyrov

In this article, we define a very important sequence of functions, all the functions of this sequence present behaviors very close to that of the Collatz function. The study of such functions allows us to obtain very interesting results…

General Mathematics · Mathematics 2021-07-13 Raouf Rajab

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been…

Computational Complexity · Computer Science 2013-07-02 Philippe Dumas

We prove a relativization of the Alon Second Eigenvalue Conjecture for all $d$-regular base graphs, $B$, with $d\ge 3$: for any $\epsilon>0$, we show that a random covering map of degree $n$ to $B$ has a new eigenvalue greater than…

Discrete Mathematics · Computer Science 2014-03-17 Joel Friedman , David-Emmanuel Kohler

We establish a one-to-one correspondence between conjugacy classes of any Hecke group and irreducible systems of poles of rational period functions for automorphic integrals on the same group. We use this correspondence to construct…

Number Theory · Mathematics 2021-02-12 Wendell Ressler

Functional equations (FE) arise quite naturally in the analysis of stochastic systems of different kinds : queueing and telecommunication networks, random walks, enumeration of planar lattice walks, etc. Frequently, the object is to…

Probability · Mathematics 2017-12-07 Guy Fayolle

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

Number Theory · Mathematics 2026-02-16 Meselem Karras

Bellantoni and Cook have given a function-algebra characterization of the polynomial-time computable functions via an unbounded recursion scheme which is called safe recursion. Inspired by their work, we characterize the exponential-time…

Computational Complexity · Computer Science 2008-03-05 Toshiyasu Arai , Naohi Eguchi

In 1994, Becker conjectured that if $F(z)$ is a $k$-regular power series, then there exists a $k$-regular rational function $R(z)$ such that $F(z)/R(z)$ satisfies a Mahler-type functional equation with polynomial coefficients where the…

Number Theory · Mathematics 2018-11-28 Jason Bell , Frederic Chyzak , Michael Coons , Philippe Dumas

All of the six Painlev\'e equations except the first have families of rational solutions, which are frequently important in applications. The third Painlev\'e equation in generic form depends on two parameters $m$ and $n$, and it has…

Classical Analysis and ODEs · Mathematics 2018-01-16 Thomas Bothner , Peter D. Miller , Yue Sheng

For a rational matrix function $\Phi$ with poles outside the unit circle, we estimate the degree of the unique superoptimal approximation $\A\Phi$ by matrix functions analytic in the unit disk. We obtain sharp estimates in the case of…

Functional Analysis · Mathematics 2007-05-23 V. V. Peller , V. I. Vasyunin

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We then present a simple application, related to possible correlations between trace…

Number Theory · Mathematics 2023-09-26 Emmanuel Kowalski

We here present three characterizations of not necessarily causal, rational functions which are (co)-isometric on the unit circle: (i) Through the realization matrix of Schur stable systems. (ii) The Blaschke-Potapov product, which is then…

Complex Variables · Mathematics 2015-01-06 Daniel Alpay , Palle Jorgensen , Izchak Lewkowicz

We show that every scheme/algebraic space/stack that is quasi-compact with quasi-finite diagonal can be approximated by a noetherian scheme/algebraic space/stack. More generally, we show that any stack which is etale-locally a global…

Algebraic Geometry · Mathematics 2015-10-01 David Rydh

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

Combinatorics · Mathematics 2014-07-22 Amritanshu Prasad
‹ Prev 1 8 9 10 Next ›