相关论文: Some explicit badly approximable pairs
For given $\epsilon>0$ and $b\in\mathbb{R}^m$, we say that a real $m\times n$ matrix $A$ is $\epsilon$-badly approximable for the target $b$ if $$\liminf_{q\in\mathbb{Z}^n, \|q\|\to\infty} \|q\|^n \langle Aq-b \rangle^m \geq \epsilon,$$…
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 consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…
We compute the Hausdorff dimension of sets of very well approximable vectors on rational quadrics. We use ubiquitous systems and the geometry of locally symmetric spaces. As a byproduct we obtain the Hausdorff dimension of the set of rays…
In a previous paper with the same title, we gave an upper bound for the exponent of uniform rational approximation to a quadruple of $\mathbb{Q}$-linearly independent real numbers in geometric progression. Here, we explain why this upper…
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.
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 stable matching problem is one of the central problems of algorithmic game theory. If participants are allowed to have ties, the problem of finding a stable matching of maximum cardinality is an NP-hard problem, even when the ties are…
Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…
We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights $w$ having finitely many zeros and singularities (i.e., points where $w$ becomes infinite) on an interval and not too ``rapidly…
This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…
Let $f$ be a homogeneous polynomial with rational coefficients in $d$ variables. We prove several results concerning uniform simultaneous approximation to points on the graph of $f$, as well as on the hypersurface $\{f(x_1,\dots,x_d) =…
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 prove that the Hausdorff dimension of the set of badly approximable systems of m linear forms in n variables over the field of Laurent series with coefficients from a finite field is maximal. This is a analogue of Schmidt's…
This paper is motivated by Davenport's problem and the subsequent work regarding badly approximable points in submanifolds of a Euclidian space. We study the problem in the area of twisted Diophantine approximation and present two different…
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…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
Recently, Ghosh \& Haynes \cite{HG} proved a Khintchine-type result for the problem of Diophantine approximation in certain projective spaces. In this note we complement their result by observing that a Jarn\'{\i}k-type result also holds…
A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Such Diophantine sets have been used to construct high rank elliptic curves.…
We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…