Related papers: Weak admissibility, primitivity, o-minimality, and…
We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopenka's principle. We prove that the necessary large-cardinal…
Motivated by problems in optimization we study the sparsity of the solutions to systems of linear Diophantine equations and linear integer programs, i.e., the number of non-zero entries of a solution, which is often referred to as the…
In this paper we prove inequalities for multiplicative analogues of Diophantine exponents, similar to the ones known in the classical case. Particularly, we show that a matrix is badly approximable if and only if its transpose is badly…
We give several results related to inhomogeneous approximations to two real numbers and badly approximable numbers. Our results are related to classical theorems by A. Khintchine (1926) and to an original method invented by Y. Peres and W.…
We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest…
The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…
We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.
In this paper, we consider the intrinsic Diophantine approximation on the triadic Cantor set $\mathcal{K}$, i.e. approximating the points in $\mathcal{K}$ by rational numbers inside $\mathcal{K}$, a question posed by K. Mahler. By using…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
Inspired by a problem proposed by Mahler, we will address the following related question, 'How well can irrationals in a missing digit set be approximated by rationals with polynomial denominators?' and prove some related results. To…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
In this paper we initiate a new approach to studying approximations by rational points to points on smooth submanifolds of $\mathbb{R}^n$. Our main result is a convergence Khintchine type theorem for arbitrary nondegenerate submanifolds of…
Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a lattice in $G$, and let $U$ be a subset of $X$ whose complement is compact. We use the exponential mixing results for diagonalizable flows on $X$ to give upper estimates for the…
We place the theory of metric Diophantine approximation on manifolds into a broader context of studying Diophantine properties of points generic with respect to certain measures on $\Bbb R^n$. The correspondence between multidimensional…
We prove central limit theorems for Diophantine approximations with congruence conditions and for inhomogeneous Diophantine approximations following the approach of Bj\"{o}rklund and Gorodnik. The main tools are the cumulant method and…
In this work we proof the following theorem which is, in addition to someother lemmas, our main result:\noindent \textbf{theorem}. Let$\ X=\{ ( x\_{1}\text{, }%t\_{1}) \text{, }( x\_{2}\text{, }t\_{2}) \text{, ..., }(x\_{n}\text{,…
Let $\Lb$ be a lattice in a Euclidean space $E$, with kissing number $s$ and perfection rank $r$, that is, the rank in $\End^{\text{sym}}(E)$ of the set of orthogonal projections to minimal vectors of $\Lb$. This defines a space of…
Lattices are discrete mathematical objects with widespread applications to integer programs as well as modern cryptography. A fundamental problem in both domains is the Closest Vector Problem (popularly known as CVP). It is well-known that…
In this paper, we apply our minimax theory ([4], [5], [6]) with the one developed by A. Moameni in [2] to formalize a general scheme giving the multiplicity of critical points. Here is a sample of application of the scheme to a critical…
We develop the metric theory of Diophantine approximation on homogeneous varieties of semisimple algebraic groups and prove results analogous to the classical Khinchin and Jarnik theorems. In full generality our results establish…