Sets of exact approximation order by complex rational numbers

نویسندگان

چکیده

For a nonincreasing function $\psi$, let $\textrm{Exact}(\psi)$ be the set of complex numbers that are approximable by rational to order $\psi$ but no better order. In this paper, we obtain Hausdorff dimension and packing when $\psi(x)=o(x^{-2})$. We also prove lower bound is greater than $2-\tau/(1-2\tau)$ $\tau=\limsup_{x\to\infty}\psi(x)x^2$ small enough.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sets of exact approximation order by rational numbers III

For a function Ψ : R>0 → R>0, let Exact(Ψ) be the set of real numbers that are approximable by rational numbers to order Ψ, but to no order cΨ with 0 < c < 1. When Ψ is non-increasing and satisfies Ψ(x) = o(x−2), we establish that Exact(Ψ) has Hausdorff dimension 2/λ, where λ is the lower order at infinity of the function 1/Ψ. Furthermore, we study the set Exact(Ψ) when Ψ is not assumed to be n...

متن کامل

Automatic Sets of Rational Numbers

The notion of a k-automatic set of integers is well-studied. We develop a new notion — the k-automatic set of rational numbers — and prove basic properties of these sets, including closure properties and decidability.

متن کامل

Approximation of Complex Numbers by Cyclotomic Integers

We present a new method of approximating complex numbers by cyclotomic integers in Ze 2i=2 n ] whose coeecients with respect to the basis given by powers of e 2i=2 n are bounded in absolute value by a given integer M. It has been suggested by Cozzens and Finkelstein 5] that such approximations reduce the dynamic range requirements of the discrete Fourier transform. For xed n our algorithm gives...

متن کامل

Approximation to Irrationals by Classes of Rational Numbers

if and only if k^l/51'2. Scott [ll] proved that if the fractions a/b are restricted to any one of the three classes (i) a, b both odd, (ii) a even, b odd, or (iii) a odd, b even, the same conclusion holds if &=g 1. Other proofs of this have been given by Oppenheim [8], Robinson [lO], and Kuipers and Meulenbeld [6]. Robinson also showed that if any pair of these classes were used, then &2il/2. L...

متن کامل

k-Automatic Sets of Rational Numbers

The notion of a k-automatic set of integers is well-studied. We develop a new notion — the k-automatic set of rational numbers — and prove basic properties of these sets, including closure properties and decidability.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Zeitschrift

سال: 2021

ISSN: ['1432-1823', '0025-5874']

DOI: https://doi.org/10.1007/s00209-021-02906-4