Related papers: Best Simultaneous Diophantine Approximations under…
A method is suggested for treating the well-known deficiency in the use of Pade approximants that are well suited for approximating rational functions, but confront problems in approximating irrational functions. We develop the approach of…
We study metric Diophantine approximation in local fields of positive characteristic. Specifically, we study the problem of improving Dirichlet's theorem in Diophantine approximation and prove very general results in this context.
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
We prove a Diophantine approximation inequality for rational points in varieties of any dimension, in the direction of Vojta's conjecture with truncated counting functions. Our results also provide a bound towards the $abc$ conjecture which…
Direct methods for the simulation of optimal control problems apply a specific discretization to the dynamics of the problem, and the discrete adjoint method is suitable to calculate corresponding conditions to approximate an optimal…
Computing the discrete rational minimax approximation in the complex plane is challenging. Apart from Ruttan's sufficient condition, there are few other sufficient conditions for global optimality. The state-of-the-art rational…
In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…
Let Q be an infinite set of positive integers. Denote by W_{\tau, n}(Q) (resp. W_{\tau, n}) the set of points in dimension n simultaneously \tau--approximable by infinitely many rationals with denominators in Q (resp. in N*). A non--trivial…
Rational best approximations (in a Chebyshev sense) to real functions are characterized by an equioscillating approximation error. Similar results do not hold true for rational best approximations to complex functions in general. In the…
In this paper, we study inhomogeneous Diophantine approximation with rational numbers of reduced form. The central object to study is the set $W(f,\theta)$ as follows, \begin{eqnarray*} \left\{x\in [0,1]:\left…
An efficient approach for the construction of separable approximations of optimal value functions from interconnected optimal control problems is presented. The approach is based on assuming decaying sensitivities between subsystems,…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
Just-in-time compilation provides significant performance improvements for programs written in dynamic languages. These benefits come from the ability of the compiler to speculate about likely cases and generate optimized code for these.…
In this work we proof the following theorem which is, in addition to someother lemmas, our main result:\noindent \textbf{theorem}. Let$\ X=\{ ( x\_{1}\text{, }%t\_{1}) \text{, }( x\_{2}\text{, }t\_{2}) \text{, ..., }(x\_{n}\text{,…
Constrained optimization problems appear in a wide variety of challenging real-world problems, where constraints often capture the physics of the underlying system. Classic methods for solving these problems rely on iterative algorithms…
This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…
We study the problem of simultaneous approximation to a fixed family of real and p-adic numbers by roots of integer polynomials of restricted type. The method that we use for this purpose was developed by H. Davenport and W.M. Schmidt in…
We study discrete-time $(m,n)$-multirate systems on separable Hilbert spaces, solving the problem of approximating such a system by one which has a shorter multirate period $(m/q,n/q)$, optimally in the Hilbert-Schmidt norm. We work in the…
We develop new methods for approximating conformal blocks as positive functions times polynomials, with applications to the numerical bootstrap. We argue that to obtain accurate bootstrap bounds, conformal block approximations should…
We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.