SearcharxivSearch

arXiv · 2106.06386

Upper bounds and spectrum for approximation exponents for subspaces of $\mathbb{R}^n$

Abstract

This paper uses W. M. Schmidt's idea formulated in 1967 to generalise the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$. Given two subspaces of $\mathbb{R}^n$ $A$ and $B$ of respective dimensions $d$ and $e$ with $d+e\leqslant n$, the proximity between $A$ and $B$ is measured by $t=\min(d,e)$ canonical angles $0\leqslant \theta_1\leqslant \cdots\leqslant \theta_t\leqslant \pi/2$; we set $\psi_j(A,B)=\sin\theta_j$. If $B$ is a rational subspace, his complexity is measured by its height $H(B)=\mathrm{covol}(B\cap\mathbb{Z}^n)$. We denote by $\mu_n(A\vert e)_j$ the exponent of approximation defined as the upper bound (possibly equal to $+\infty$) of the set of $\beta>0$ such that for infinitely many rational subspaces $B$ of dimension $e$, the inequality $\psi_j(A,B)\leqslant H(B)^{-\beta}$ holds. We are interested in the minimal value $\mathring{\mu}_n(d\vert e)_j$ taken by $\mu_n(A\vert e)_j$ when $A$ ranges through the set of subspaces of dimension $d$ of $\mathbb{R}^n$ such that for all rational subspaces $B$ of dimension $e$ one has $\dim(A\cap B)<j$. We show that if $A$ is included in a rational subspace $F$ of dimension $k$, its exponent in $\mathbb{R}^n$ is the same as its exponent in $\mathbb{R}^k$ via a rational isomorphism $F\to\mathbb{R}^k$. This allows us to deduce new upper bounds for $\mathring{\mu}_n(d\vert e)_j$. We also study the values taken by $\mu_n(A\vert e)_e$ when $A$ is a subspace of $\mathbb{R}^n$ satisfying $\dim(A\cap B)<e$ for all rational subspaces $B$ of dimension $e$.

Explore related subjects

Keep this discovery

BibTeXRIS

Elio Joseph. 2021-06-11. Upper bounds and spectrum for approximation exponents for subspaces of $\mathbb{R}^n$. https://arxiv.org/abs/2106.06386

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR