Add to ORKGAbstract. We show that the set of complex numbers which are badly approximable by ratios of elements of Z
We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit...
Addressing a problem of Davenport we show that any finite intersection of the sets of weighted badly...
AbstractFor any real number θ, the set of all real numbers x for which there exists a constant c(x)>...
AbstractA number α is called badly approximable if there is a constant c = c(α)>0 such that |q|αq − ...
AbstractLet (X,d) be a metric space and (Ω,d) a compact subspace of X which supports a non-atomic fi...
Let (X,d) be a metric space and (Ω,d) a compact subspace of X which supports a non-atomic finite mea...
On the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomial
AbstractI consider the Diophantine approximation problem of sup-norm simultaneous rational approxima...
AbstractWe characterize the sequences {zn} of complex numbers which are sequences of approximants of...
We consider a problem originating both from circle coverings and badly approximable numbers in the c...
We call a badly approximable number $decaying$ if, roughly, the Lagrange constants of integer multip...
We show that a large class of Cantor-like sets of R-d, d >= 1, contains uncountably many badly appro...
AbstractA result of Davenport and Schmidt related to Wirsing's problem is generalized so that comple...
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomia...
The conditions for equality of complex numbers are given. An example of grouping and then equating r...
We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit...
Addressing a problem of Davenport we show that any finite intersection of the sets of weighted badly...
AbstractFor any real number θ, the set of all real numbers x for which there exists a constant c(x)>...
AbstractA number α is called badly approximable if there is a constant c = c(α)>0 such that |q|αq − ...
AbstractLet (X,d) be a metric space and (Ω,d) a compact subspace of X which supports a non-atomic fi...
Let (X,d) be a metric space and (Ω,d) a compact subspace of X which supports a non-atomic finite mea...
On the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomial
AbstractI consider the Diophantine approximation problem of sup-norm simultaneous rational approxima...
AbstractWe characterize the sequences {zn} of complex numbers which are sequences of approximants of...
We consider a problem originating both from circle coverings and badly approximable numbers in the c...
We call a badly approximable number $decaying$ if, roughly, the Lagrange constants of integer multip...
We show that a large class of Cantor-like sets of R-d, d >= 1, contains uncountably many badly appro...
AbstractA result of Davenport and Schmidt related to Wirsing's problem is generalized so that comple...
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomia...
The conditions for equality of complex numbers are given. An example of grouping and then equating r...
We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit...
Addressing a problem of Davenport we show that any finite intersection of the sets of weighted badly...
AbstractFor any real number θ, the set of all real numbers x for which there exists a constant c(x)>...