Upper bounds and spectrum for approximation exponents for subspaces of $\mathbb{R}^n$
Elio Joseph (LMO)

TL;DR
This paper extends Diophantine approximation theory to subspaces of b^n, establishing bounds on approximation exponents based on subspace angles, rationality, and intersections, with implications for understanding subspace approximation complexity.
Contribution
It generalizes classical Diophantine approximation to subspaces, providing new bounds and invariance results for approximation exponents involving rational subspaces.
Findings
Derived upper bounds for minimal approximation exponents.
Proved invariance of exponents under rational isomorphisms.
Analyzed exponents for subspaces with specific intersection properties.
Abstract
This paper uses W. M. Schmidt's idea formulated in 1967 to generalise the classical theory of Diophantine approximation to subspaces of . Given two subspaces of and of respective dimensions and with , the proximity between and is measured by canonical angles ; we set . If is a rational subspace, his complexity is measured by its height . We denote by the exponent of approximation defined as the upper bound (possibly equal to ) of the set of such that for infinitely many rational subspaces of dimension , the inequality holds. We are interested in the minimal value…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Digital Image Processing Techniques · semigroups and automata theory
