Related papers: Badly approximable numbers over imaginary quadrati…
We consider approximation of vectors $\mathbf{z}\in F\otimes\mathbb{R}\cong\mathbb{R}^r\times\mathbb{C}^s$ by elements of a number field $F$ and construct examples of badly approximable vectors. These examples come from compact subspaces of…
Let $\frak E$ denote be the ring of Eisenstein integers. Let $z\in \mathbb C$ and $p_n,q_n \in \frak E$ be such that $\{p_n/q_n\}$ is the sequence of convergents corresponding to the continued fraction expansion of $z$ with respect to the…
In this paper we prove that all irrational numbers from totally real cubic number fields are well approximable by rationals (i.e. the partial quotients in the continued fraction expansion of such a number are unbounded). This settles the…
We study the generalized continued fraction expansions of complex numbers in term of elements from Euclidean subrings, especially Gaussian or Eisenstein integers, in a general framework as pursued in [3] and [1]. We introduce a common…
We prove a refined version of Markov's theorem in Diophantine approximation. More precisely, we characterize completely the set of irrationals $x$ such that $\left|x-\frac{p}{q}\right|<\frac{1}{3q^2}$ has only finitely many rational…
We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It…
We study the orbit of $\mathbb{R}$ under the Bianchi group $\operatorname{PSL}_2(\mathcal{O}_K)$, where $K$ is an imaginary quadratic field. The orbit, called a Schmidt arrangement $\mathcal{S}_K$, is a geometric realisation, as an…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
A pair $(A,\mathbf{b})$ of a real $m\times n$ matrix $A$ and $\mathbf{b}\in\mathbb{R}^m$ is said to be $\textit{infinitely badly approximable}$ if \[ \liminf_{\mathbf{q}\in\mathbb{Z}^n, \|\mathbf{q}\|\to\infty}…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…
We show an analogue of a theorem of An, Ghosh, Guan, and Ly on weighted badly approximable vectors for totally imaginary number fields. We show that for $G=\mathrm{SL}_2(\mathbb{C})\times\dots\times\mathrm{SL}_2(\mathbb{C})$ and $\Gamma<G$…
Given an integral indefinite binary Hermitian form f over an imaginary quadratic number field, we give a precise asymptotic equivalent to the number of nonequivalent representations, satisfying some congruence properties, of the rational…
We show that points on $C^{1}$ curves which are badly approximable by rationals in a number field form a winning set in the sense of W. M. Schmidt. As a consequence, we obtain a number field version of Schmidt's conjecture.
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…
The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…
In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…
Approximation in this paper is of vectors on the unit $d$-cube by the projection of integer lattice points onto the same cube. We define badly approximable vectors on a rational quadratic variety and show that sets of these vectors, which…
Algebraic integers in totally imaginary quartic number fields are not discrete in the complex plane under a fixed embedding, which makes it impossible to visualize all integers in the plane, unlike the quadratic imaginary algebraic…