Related papers: Diophantine approximation on lines in \mathbb{C}^2…

We study multiplicative Diophantine approximation property of vectors and compute Diophantine exponents of hyperplanes via dynamics.

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.

We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $a\sigma(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath…

Let $c$ be fixed with $1<c<35/34$. In this paper we prove that for every sufficiently large real number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c-N|<\varepsilon \end{equation*}…

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 study quadratic approximations for two families of hyperquadratic continued fractions in the field of Laurent series over a finite field. As the first application, we give the answer to a question of the second author concerning…

Let $\phi(z)$ be a non-isotrivial rational function in one-variable with coefficients in $\overline{\mathbb{F}}_p(t)$ and assume that $\gamma\in\mathbb{P}^1(\overline{\mathbb{F}}_p(t))$ is not a post-critical point for $\phi$. Then we prove…

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 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…

This paper addresses a problem recently raised by Laurent and Nogueira about inhomogeneous Diophantine approximation with coprime integers. As a corollary of our main theorem we obtain an improvement of the best known exponent of…

This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…

We prove sharp estimates in a shrinking target problem for the action of an arbitrary subgroup $\Gamma$ of $SL_2(\mathbb{Z})$ on the 2-torus. This can also be viewed as a non-commutative Diophantine approximation problem. The methods…

We develop a variety of new techniques to treat Diophantine equations of the shape $x^2+D =y^n$, based upon bounds for linear forms in $p$-adic and complex logarithms, the modularity of Galois representations attached to Frey-Hellegouarch…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…

We prove a new lower bound for the exponent of growth of the best two-dimensional Diophantine approximations with respect to Euclidean norm.

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…

We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.

This brief survey deals with multi-dimensional Diophantine approximations in sense of linear form and with simultaneous Diophantine approximations. We discuss the phenomenon of degenerate dimension of linear subspaces generated by the best…

Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…