Related papers: On Furstenberg's Diophantine result

We prove a dynamical version of the Mordell-Lang conjecture in the context of Drinfeld modules. We use analytic methods similar to the ones employed by Skolem, Chabauty, and Coleman for studying diophantine equations.

We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.

We demonstrate how connections between graph theory and Diophantine approximation can be used in conjunction to give simple and accessible proofs of seemingly difficult results in both subjects.

In this paper we prove a conjecture of Kleinbock and Tomanov \cite[Conjecture~FP]{KT} on Diophantine properties of a large class of fractal measures on $\mathbb{Q}_p^n$. More generally, we establish the $p$-adic analogues of the influential…

We prove a strong analogue of Liouville's Theorem in Diophantine approximation for points on arbitrary algebraic varieties. We use this theorem to prove a conjecture of the first author for cubic surfaces in $\P^3$.

Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local…

We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic…

In this note, we present an improvement to a recent result due to Beresnevich, Levesley, and Ward (2021) pertaining to weighted simultaneous Diophantine approximation on manifolds.

We establish several new inequalities linking classical exponents of Diophantine approximation associated to a real vector $\underline{\xi}=(\xi,\xi^{2},\ldots,\xi^{N})$, in various dimensions $N$. We thereby obtain variants, and partly…

We prove an estimate for the number of lattice points lying in certain non-convex Euclidean domains of interest in Diophantine approximation. As an application, we generalise a result of Kruse (1964) concerning the almost sure order of…

We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…

In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in…

In this paper we give a simple proof of an inequality for intermediate Diophantine exponents obtained recently by W. M. Schmidt and L. Summerer.

We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…

The aim of this work is to illustrate a conditional result involving the exponential sums over primes in short intervals under the assumption that both the Generalized Riemann Hypothesis and the Density Hypothesis for Dirichlet…

We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…

In this paper we prove that uniform Diophantine exponents of lattices attain only trivial values.

We draw connections between the various conjectures which are included in G. R\'emond's generalized Lehmer problems. Specifically, we show that the degree one form of his conjecture for the multiplicative group is, in a sense, almost as…

We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…

L. Weinstein's brilliant short proof of de Branges's Theorem is made even shorter by using computer algebra.