English
Related papers

Related papers: Effective results for Diophantine equations over f…

200 papers

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…

Number Theory · Mathematics 2022-04-27 L. Hajdu , R. Tijdeman

We prove the following two results 1. For a proper holomorphic function $ f : X \to D$ of a complex manifold $X$ on a disc such that $\{df = 0 \} \subset f^{-1}(0)$, we construct, in a functorial way, for each integer $p$, a geometric…

Algebraic Geometry · Mathematics 2008-01-29 Daniel Barlet

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

Number Theory · Mathematics 2025-03-20 Zhong-Peng Zhou

In this paper we obtain three undecidable results for exponential diophantine equations over the field $\mathbb Q$ of rational numbers. For example, we prove that there is no algorithm to decide the solvability of a general exponential…

Number Theory · Mathematics 2021-12-02 Zhi-Wei Sun

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

Number Theory · Mathematics 2015-02-27 Thomas Reuss

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Logic · Mathematics 2014-10-21 Apoloniusz Tyszka

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…

Number Theory · Mathematics 2025-03-14 Bogdan A. Dobrescu , Patrick J. Fox

We consider a strongly nonlinear differential equation of the following general type $$(\Phi(a(t,x(t)) \, x'(t)))'= f(t,x(t),x'(t)), \quad \text{a.e. on $[0,T]$}$$ where $f$ is a Carath\'edory function, $\Phi$ is a strictly increasing…

Classical Analysis and ODEs · Mathematics 2019-10-25 Stefano Biagi , Alessandro Calamai , Francesca Papalini

Let $F$ be an irreducible binary form attached to a number field $K$ of degree $\geq 3$. Let $\epsilon\not\in \{-1, 1\}$ be a totally real unit of $K$. By twisting $F$ with the powers $\epsilon^a$ of $\epsilon$, ($a\in{\mathbf Z}$), we…

Number Theory · Mathematics 2015-05-26 Claude Levesque , Michel Waldschmidt

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

Logic in Computer Science · Computer Science 2025-09-30 Jonas Bayer , Marco David

We give a series of very general sufficient conditions in order to ensure the uniqueness of large solutions for --$\Delta$u + f (x, u) = 0 in a bounded domain $\Omega$ where f : $\Omega$ x R $\rightarrow$ R + is a continuous function, such…

Analysis of PDEs · Mathematics 2020-07-15 Julián López-Gómez , Luis Maire , Laurent Veron

We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided…

Number Theory · Mathematics 2013-07-23 Shabnam Akhtari

We consider binomial Thue equations of type $x^n-my^n=\pm 1$ in $x,y\in Z$. Optimizing the method of Peth\H o we perform an extensive calculation by a high performance computer to determine all solutions with $\max(|x|,|y|)<10^{500}$ of…

Number Theory · Mathematics 2018-10-04 István Gaál , László Remete

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…

Rings and Algebras · Mathematics 2022-10-26 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…

Number Theory · Mathematics 2021-08-02 Constantinos Poulias

Let $f$ be a polynomial with coefficients in the ring $O_S$ of $S$-integers of a number field $K$, $b$ a non-zero $S$-integer, and $m$ an integer $\ge 2$. We consider the equation $( \star )$: $f(x) = b y^m$ in $x,y \in O_S$. Under the…

Number Theory · Mathematics 2023-10-17 Attila Bérczes , Yann Bugeaud , Kálmán Győry , Jorge Mello , Alina Ostafe , Min Sha

In this paper, we consider the equations involving Euler's totient function $\phi$ and Lucas type sequences. In particular, we prove that the equation $\phi (x^m-y^m)=x^n-y^n$ has no solutions in positive integers $x, y, m, n$ except for…

Number Theory · Mathematics 2022-01-27 Yong-Gao Chen , Hao Tian

We study the Dirichlet problem for fully nonlinear, degenerate elliptic equations of the form f(Hess, u)=0 on a smoothly bounded domain D in R^n. In our approach the equation is replaced by a subset F of the space of symmetric nxn-matrices,…

Analysis of PDEs · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson,

We consider the Diophantine equation X^n - 1 = B.Z^n, where B in Z is understood as a parameter. We prove that if the equation has a solution, then either the Euler totient of the radical, phi(rad (B)), has a common divisor with the…

Number Theory · Mathematics 2015-07-01 Boris Bartolome , Preda Mihailescu

We revisit a work by R. Okazaki and prove that for every cubic binary form F(x, y) with large enough discriminant, the Thue equation |F(x, y)| = 1 has at most 7 solutions in integers x and y.

Number Theory · Mathematics 2009-07-21 Shabnam Akhtari