A quantitative version of Runge's theorem on diophantine equations
From MaRDI portal
Publication:4015358
DOI10.4064/aa-62-2-157-172zbMath0769.11017OpenAlexW256612138MaRDI QIDQ4015358
Publication date: 19 January 1993
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/206487
Related Items (25)
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Effective estimation of integer points of a family of algebraic curves ⋮ Polynomial bounds for the solutions of a class of diophantine equations ⋮ Polynomials with values which are powers of integers ⋮ Quasi-Equivalence of Heights and Runge’s Theorem ⋮ Diophantine equations with three monomials ⋮ A note on lower bounds for ranks using Pell equations ⋮ On the Diophantine equation \(\prod_{i \leq m}(d_iy + q_i) = f(x)\) ⋮ On the global distance between two algebraic points on a curve. ⋮ On a problem of Erdős and Graham ⋮ Nonexistence of nontrivial tight 8-designs ⋮ The diophantine equation \((y+q_1)(y+q_2) \cdots (y+q_m) = f(x)\) ⋮ Unnamed Item ⋮ Computing all integer solutions of a genus 1 equation ⋮ An algorithm for solving a family of fourth-degree Diophantine equations that satisfy Runge's condition ⋮ Extending Runge’s method for integral points ⋮ Irreducibility testing over local fields ⋮ Power values of sums of products of consecutive integers ⋮ Variations on a theme of Runge: effective determination of integral points on certain varieties ⋮ On the size of the intersection of two Lucas sequences of distinct type. II ⋮ On equal values of pyramidal and polygonal numbers ⋮ A Polynomial Time Complexity Bound for Computations on Curves ⋮ An Algorithmic Implementation of Runge’s Method for Cubic Diophantine Equations ⋮ An Elementary Algorithm for Solving a Diophantine Equation of Degree Fourth with Runge’s Condition ⋮ The Skolem-Abouzaïd theorem in the singular case
This page was built for publication: A quantitative version of Runge's theorem on diophantine equations
