Related papers: Rational approximation of Euler's constant using m…

We investigate two inequalities of Bugeaud and Laurent, each involving triples of classical exponents of Diophantine approximation associated to $\ux\in\mathbb{R}^n$. We provide a complete description of parameter triples that admit…

Building upon the recent works of Bertola; Fasondini, Olver and Xu, we define a class of orthogonal polynomials on elliptic curves and establish a corresponding Riemann-Hilbert framework. We then focus on the special case, defined by a…

We adapt ideas of Phong, Stein and Sturm and ideas of Ikromov and M\"uller from the continuous setting to various discrete settings, obtaining sharp bounds for exponential sums and the number of solutions to polynomial congruences for…

This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…

We consider matrix orthogonal polynomials related to Bessel type matrices of weights that can be defined in terms of a given matrix Pearson equation. From a Riemann-Hilbert problem we derive first and second order differential relations for…

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…

In this paper we consider the strong asymptotic behavior of Laguerre polynomials in the complex plane. The leading behavior is well known from Perron and Mehler-Heine formulas, but higher order coefficients, which are important in the…

We draw connections between the various conjectures which are included in G. R\'emond's generalized Lehmer problems. Specifically, we show that the degree one form of his conjecture for the multiplicative group is, in a sense, almost as…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

A recent result of S.-Y. Lee and M. Yang states that the planar orthogonal polynomials orthogonal with respect to a modified Gaussian measure are multiple orthogonal polynomials of type II on a contour in the complex plane. We show that the…

We consider orthogonal polynomials p_n with respect to an exponential weight function w(x) = exp(-P(x)). The related equations for the recurrence coefficients have been explored by many people, starting essentially with Laguerre [49], in…

This paper delves into classical multiple orthogonal polynomials with an arbitrary number of weights, including Jacobi-Pi\~neiro, Laguerre of both first and second kinds, as well as multiple orthogonal Hermite polynomials. Novel explicit…

In 1984, Kurt Mahler posed the following fundamental question: How well can irrationals in the Cantor set be approximated by rationals in the Cantor set? Towards development of such a theory, we prove a Dirichlet-type theorem for this…

The two-parameter Mittag-Leffler function $E_{\alpha, \beta}$ is of fundamental importance in fractional calculus. It appears frequently in the solutions of fractional differential and integral equations. Nonetheless, this vital function is…

We establish a new upper bound for the number of rationals up to a given height in a missing-digit set, making progress towards a conjecture of Broderick, Fishman, and Reich. This enables us to make novel progress towards another conjecture…

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

We study polynomials that are orthogonal with respect to a varying quartic weight \exp(-N(x^2/2+tx^4/4)) for t<0, where the orthogonality takes place on certain contours in the complex plane. Inspired by developments in 2D quantum gravity,…

We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

The classical orthogonal polynomials (Hermite, Laguerre and Jacobi) are involved in a vast number of applications in physics and engineering. When large degrees $n$ are needed, the use of recursion to compute the polynomials is not a good…