Papers
Topics
Authors
Recent
Search
2000 character limit reached

Singularity, weighted uniform approximation, intersections and rates

Published 23 Sep 2024 in math.NT and math.DS | (2409.15607v3)

Abstract: A classical argument was introduced by Khintchine in 1926 in order to exhibit the existence of totally irrational singular linear forms in two variables. This argument was subsequently revisited and extended by many authors. For instance, in 1959 Jarnik used it to show that for $n \geq 2$ and for any non-increasing positive $f$ there are totally irrational matrices $A \in M_{m,n}({\mathbb R})$ such that for all large enough $t$ there are $\mathbf{p} \in {\mathbb Z}m, \mathbf{q} \in {\mathbb Z}n \smallsetminus {0}$ with $$|\mathbf{q}| \leq t \ \text{ and } \ |A \mathbf{q} - \mathbf{p}| \leq f(t).$$ We denote the collection of such matrices by $\mathrm{UA}*_{m,n}(f)$. We adapt Khintchine's argument to show that the sets $\mathrm{UA}*_{m,n}(f)$, and their weighted analogues $\mathrm{UA}*_{m,n}(f, \mathbf{w})$, intersect many manifolds and fractals, and have strong intersection properties. For example, we show that: When $n \geq 2$, the set $\bigcap_{\mathbf{w}} \mathrm{UA}*(f, \mathbf{w}) $, where the intersection is over all weights $\mathbf{w}$, is nonempty, and moreover intesects many manifolds and fractals; For $n \geq 2$, there are vectors in ${\mathbb R}n$ which are simultaneously $k$-singular for every $k$, in the sense of Yu; when $n \geq 3$, $\mathrm{UA}*_{1,n}(f) + \mathrm{UA}*_{1,n}(f) = {\mathbb R}n$. We also obtain new bounds on the rate of singularity which can be attained by column vectors in analytic submanifolds of dimension at least 2 in ${\mathbb R}n$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 3 tweets with 4 likes about this paper.