Related papers: Rational approximation on quadrics: a simplex lemm…
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…
We prove analogues of some classical results from Diophantine approximation and metric number theory (namely Dirichlet's theorem and the Duffin--Schaeffer theorem) in the setting of diagonal Diophantine approximation, i.e. approximating…
We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…
We sharpen to nearly optimal the known asymptotic and explicit bounds for the number of $\mathbb{F}_q$-rational points on a geometrically irreducible hypersurface over a (large) finite field. The proof involves a Bertini-type probabilistic…
In this survey article, we explore a central theme in Diophantine approximation inspired by a celebrated result of Besicovitch on the Hausdorff dimension of well approximable real numbers. We outline some of the key developments stemming…
We prove a version of the Khinchine--Groshev theorem for Diophantine approximation of matrices subject to a congruence condition. The proof relies on an extension of the Dani correspondence to the quotient by a congruence subgroup. This…
In this paper we present a variety of statements that are in the spirit of the famous theorem of Pascal, often referred to as the Mystic Hexagon. We give explicit equations describing the conditions for $d+4$ points to lie on rational…
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…
Let X be a smooth quartic surface not containing lines, defined over a number field K. We prove that there are only finitely many bitangents to X which are defined over K. This result can be interpreted as saying that a certain surface,…
On a generalized flag variety of rank one, we count rational approximations to a real point chosen randomly according to the Riemannian volume. In particular, our results apply to Grassmann varieties and quadric hypersurfaces. The proof…
We answer a question raised by Alam and Ghosh concerning an error term for a spiralling result in Diophantine approximation by rationals in a number field. The proof relies on a generalisation of Rogers' Mean Value Theorem to algebraic…
We prove a new quantitative result on the degeneracy of the dimension of the subspace spanned by the best Diophantine approximations for a linear form.
Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…
We provide a formal, simple and intuitive theory of rational decision making including sequential decisions that affect the environment. The theory has a geometric flavor, which makes the arguments easy to visualize and understand. Our…
We give a necessary and sufficient condition for the smooth extension of a diffeomorphism between smooth strictly pseudoconvex domains in four real dimensional almost complex manifolds. The proof is mainly based on a reflection principle…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
In this article we establish an asymptotic formula for the number of rational points, with bounded denominators, within a given distance to a compact submanifold $\mathcal{M}$ of $\mathbb{R}^M$ with a certain curvature condition. Our result…
We solved the problem of the best rational approximation of the Bergman kernels on the unit circle of the complex plane in the quadratic and uniform metrics.
We design and analyze an algorithm for computing rational points of hypersurfaces defined over a finite field based on searches on "vertical strips", namely searches on parallel lines in a given direction. Our results show that, on average,…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…