Related papers: Diophantine approximation by rational numbers of c…
By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…
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…
Given quantities $\Delta_1,\Delta_2,\dots\geqslant 0$, a fundamental problem in Diophantine approximation is to understand which irrational numbers $x$ have infinitely many reduced rational approximations $a/q$ such that $|x-a/q|<\Delta_q$.…
In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…
We compute the sequence of best Diophantine approximations for some pairs of cubic Pisot numbers which do not satisfy the Property (F).
We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…
In this notes we make a comparison between the arithmetic properties of irrational numbers and their dynamical properties under the Gauss map. We show some equivalences between different classifications of irrational numbers such as the…
We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…
We study ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their preferred matches, but must compete with fully omniscient…
This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in…
Diophantine approximation explores how well irrational numbers can be approximated by rationals, with foundational results by Dirichlet, Hurwitz, and Liouville culminating in Roth's theorem. Schmidt's subspace theorem extends Roth's results…
We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…
Inspired by a problem proposed by Mahler, we will address the following related question, 'How well can irrationals in a missing digit set be approximated by rationals with polynomial denominators?' and prove some related results. To…
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…
Following T. H. Chan, we consider the problem of approximation of a given rational fraction a/q by sums of several rational fractions a_1/q_1, ..., a_n/q_n with smaller denominators. We show that in the special cases of n=3 and n=4 and…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…
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 first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.