A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set

DOI10.12988/imf.2013.13005zbMath1301.11080arXiv1109.3826OpenAlexW2507973166WikidataQ122953327 ScholiaQ122953327MaRDI QIDQ5401918

Apoloniusz Tyszka, Agnieszka Peszek, MacIej Sporysz

Publication date: 12 March 2014

Published in: International Mathematical Forum (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.3826

zbMATH Keywords

Diophantine equationcomputable upper boundfinite number of integer solutionsfinite number of rational solutionsheights of integer solutionsheights of rational solutions

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Counting solutions of Diophantine equations (11D45)

Related Items (1)

Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation

This page was built for publication: A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set