Related papers: Effective Approximation and Diophantine Applicatio…

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…

Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…

Using the circle method in combination with lattice point counting arguments, we show that for almost all homogeneous diophantine equations of additive type and degree $k$ in more than $4k$ variables, the Local-Global principle holds true.…

We establish the first effective improvements on the Liouville inequality for approximation to complex non-real algebraic numbers by complex algebraic numbers of degree at most 4.

This paper introduces some methods to determine the simultaneous approximation constants of a class of well approximable numbers $\zeta_{1},\zeta_{2},...,\zeta_{k}$. The approach relies on results on the connection between the set of all…

We construct new rational approximants of Euler's constant that improve those of Aptekarev et al. (2007) and Rivoal (2009). The approximants are given in terms of certain (mixed type) multiple orthogonal polynomials associated with the…

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…

In this paper, first, we prove that the Diophantine system \[f(z)=f(x)+f(y)=f(u)-f(v)=f(p)f(q)\] has infinitely many integer solutions for $f(X)=X(X+a)$ with nonzero integers $a\equiv 0,1,4\pmod{5}$. Second, we show that the above…

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…

The irrationality exponent $\mu(t)$ of an irrational number t, defined using the irrationality measure $1/q^\mu$, distinguishes among non-Liouville numbers and is infinite for Liouville numbers. Using the irrationality measure $1/\beta^q$,…

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…

For an invariant probability measure for the Gauss map, almost all numbers are Diophantine if the log of the partial quotient function is integrable. We show that with respect to a ``continued fraction mixing'' measure for the Gauss map…

Matom\"aki proved that if $\alpha\in \mathbb{R}$ is irrational, then there are infinitely many primes $p$ such that $|\alpha-a/p|\le p^{-4/3+\varepsilon}$ for a suitable integer a. In this paper, we extend this result to all quadratic…

We establish sharp algebraic criteria for the $L^{p}$-integrability, for $p = 1, 2, \infty$, of a natural generalization of the Siegel transform to the setting of rational representations of semisimple algebraic $\mathbb{Q}$-groups,…

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…

By applying inter-universal Teichm\"uller theory and its slight modification over the rational number field, we prove new Diophantine results towards effective abc inequalities and the generalized Fermat equations. For coprime integers $a,…

We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

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

Gallagher's theorem describes the multiplicative diophantine approximation rate of a typical vector. We establish a fully-inhomogeneous version of Gallagher's theorem, a diophantine fibre refinement, and a sharp and unexpected threshold for…