2000 character limit reached
Dimension estimates for sets of uniformly badly approximable systems of linear forms
Published 21 Nov 2013 in math.NT and math.DS | (1311.5474v5)
Abstract: The set of badly approximable $m \times n $ matrices is known to have Hausdorff dimension $mn $. Each such matrix comes with its own approximation constant $c$, and one can ask for the dimension of the set of badly approximable matrices with approximation constant greater than or equal to some fixed $c$. In the one-dimensional case, a very precise answer to this question is known. In this note, we obtain upper and lower bounds in higher dimensions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.