Multiplicatively badly approximable matrices up to logarithmic factors

Abstract

Abstract Let \[||x||\] denote the distance from \[x \in \mathbb{R}\] to the nearest integer. In this paper, we prove a new existence and density result for matrices \[A \in {\mathbb{R}^{m \times n}}\] satisfying the inequality \[\mathop {\lim \inf }\limits_{|q{|_\infty } \to + \infty } \prod\limits_{j = 1}^n {\max } \{ 1,|{q_j}|\} \log {\left( {\prod\limits_{j = 1}^n {\max } \{ 1,|{q_j}|\} } \right)^{m + n - 1}}\prod\limits_{i = 1}^m {{A_i}q} > 0,\] where q ranges in \[{\mathbb{Z}^n}\] and A i denote the rows of the matrix A . This result extends previous work of Moshchevitin both to arbitrary dimension and to the inhomogeneous setting. The estimates needed to apply Moshchevitin’s method to the case m > 2 are not currently available. We therefore develop a substantially different method, based on Cantor-like set constructions of Badziahin and Velani. Matrices with the above property also appear to have very small sums of reciprocals of fractional parts. This fact helps us to shed light on a question raised by Lê and Vaaler on such sums, thereby proving some new estimates in higher dimension.