Related papers: Best Simultaneous Diophantine Approximations under…
We study multiplicative Diophantine approximation property of vectors and compute Diophantine exponents of hyperplanes via dynamics.
We prove new quantitative Schmidt-type theorem for Diophantine approximations with restraint denominators on fractals (more precisely, on $M_0$-sets). Our theorems introduce a sharp balance condition between the growth rate of the sequence…
The Hausdorff dimension of the set of simultaneously tau well approximable points lying on a curve defined by a polynomial P(X)+alpha, where P(X) is a polynomial with integer coefficients and alpha is in R, is studied when tau is larger…
We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…
We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses the LLL-algorithm for lattice basis reduction. We present a version of the…
In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin,…
Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…
We study the problem of optimal subset selection from a set of correlated random variables. In particular, we consider the associated combinatorial optimization problem of maximizing the determinant of a symmetric positive definite matrix…
Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…
We study the problem of Diophantine approximation on lines in $\mathbb{C}^2$ with numerators and denominators restricted to Gaussian primes. To this end, we develop analogs of well-known results on small fractional parts of $p\gamma$, $p$…
This paper studies approximate solutions of a linear fractional vector optimization problem without requiring boundedness of the constraint set. We establish necessary and sufficient conditions for approximating weakly efficient points of…
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…
The objective of this paper is to (partially) address the issue of finding an analogue to Khintchine's theorem for IFS Fractals. We study the convergence case for Diophantine approximations, and show an improved result for higher…
Intrinsic Diophantine approximation on fractals, such as the Cantor ternary set, was undoubtedly motivated by questions asked by K. Mahler (1984). One of the main goals of this paper is to develop and utilize the theory of infinite de…
We obtain some new inequalities between the ordinary and the uniform Diophantine exponents for simultaneous Diophantine approximation to four real numbers.
We establish several new inequalities linking classical exponents of Diophantine approximation associated to a real vector $\underline{\xi}=(\xi,\xi^{2},\ldots,\xi^{N})$, in various dimensions $N$. We thereby obtain variants, and partly…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
We place the theory of metric Diophantine approximation on manifolds into a broader context of studying Diophantine properties of points generic with respect to certain measures on $\Bbb R^n$. The correspondence between multidimensional…
The use of separable approximations is proposed to mitigate the curse of dimensionality related to the approximation of high-dimensional value functions in optimal control. The separable approximation exploits intrinsic decaying sensitivity…
Unitary best approximation to the exponential function on an interval on the imaginary axis has been introduced recently. In the present work two algorithms are considered to compute this best approximant: an algorithm based on rational…