Related papers: On Furstenberg's Diophantine result

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

We prove positive characteristic versions of the logarithm laws of Sullivan and Kleinbock-Margulis and obtain related results in Metric Diophantine Approximation.

We prove strong convergence theorems of some iterative algorithms in a real uniformly smooth Banach space. The results presented extend, generalize and improve the corresponding results recently announced by many authors.

Many results related to quantitative problems in the metric theory of Diophantine approximation are asymptotic, such as the number of rational solutions to certain inequalities grows with the same rate almost everywhere modulo an asymptotic…

Let A be an arbitrary integral domain of characteristic 0 which is finitely generated over Z. We consider Thue equations $F(x,y)=b$ with unknowns x,y from A and hyper- and superelliptic equations $f(x)=by^m$ with unknowns from A, where the…

We present a proof of a multidimensional version of Peres-Schlag's theorem on Diophantine approximations with lacunary sequences.

Recent years have seen very important developments at the interface of Diophantine approximation and homogeneous dynamics. In the first part of the paper we give a brief exposition of a dictionary developed by Dani and Kleinbock-Margulis…

A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…

We prove the Martingale Convergence Theorem by using the work of L. Dubins and I. Monroe about embedding a given discrete-time martingale in the sample paths of a Brownian motion.

We give a simplified exposition of the easiest case of a breakthrough result by D.Badziahin, A.Pollington and S.Velani related to W.M.Schmidt's conjecture.

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

We establish a strong form of Littlewood's conjecture with inhomogeneous shifts, for a full-dimensional set of pairs of badly approximable numbers on a vertical line. We also prove a uniform assertion of this nature, generalising a strong…

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 summarize results concerning the Bernstein property of differential equations.

In this paper I give new elementary proofs of basic results of Gelfand, Kapranov and Zelevinskywhich express discriminants and resultants in terms of determinants of direct images of Cayley-Koszul complexes of sheaves.

We show that the parabola is of strong Khintchine type for convergence, which is the first result of its kind for curves. Moreover, Jarnik type theorems are established in both the simultaneous and the dual settings, without monotonicity on…

Let $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w…

We prove that the matrix analogue of the Veronese curve is strongly extremal in the sense of Diophantine approximation, thereby resolving a question posed by Beresnevich, Kleinbock, and Margulis ('15) in the affirmative.

n this paper we refine Vahlen's 1895 result in Diophantine approximation by providing sharper bounds for the approximation coefficients, especially when at least one of the partial quotients $a_n$ or $a_{n+1}$ of the regular continued…

Let $g\ge 2$ be an integer and $\mathcal R_g\subset \mathbb N$ be the set of repdigits in base $g$. Let $\mathcal D_g$ be the set of Diophantine triples with values in $\mathcal R_g$; that is, $\mathcal D_g$ is the set of all triples…