Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

On the smallest open Diophantine equations

Published: 20 April 2022 Publication History

Abstract

This paper reports on the current status of the project in which we order all polynomial Diophantine equations by an appropriate version of "size", and then solve the equations in that order. We list the "smallest" equations that are currently open, both unrestricted and in various families, like the smallest open symmetric, 2-variable or 3-monomial equations. All the equations we discuss are amazingly simple to write down but some of them seem to be very difficult to solve.

References

[1]
Dario Alpern. Generic two integer variable equation solver. https://www.alpertron.com.ar/ QUAD.HTM, 2020 (accessed June 12, 2020).
[2]
Titu Andreescu and Dorin Andrica. Quadratic Diophantine Equations. Springer, 2015.
[3]
Titu Andreescu and Dorin Andrica. An introduction to Diophantine equations: a problem-based approach. Springer, 2010.
[4]
Alan Baker. Bounds for the solutions of the hyperelliptic equation. Mathematical Proceedings of the Cambridge Philosophical Society, 65(2):439--444, 1969.
[5]
Alan Baker and John Coates. Integer points on curves of genus 1. Mathematical Proceedings of the Cambridge Philosophical Society, 67(3):595--602, 1970.
[6]
Andrew R Booker and Andrew V Sutherland. On a question of Mordell. Proceedings of the National Academy of Sciences, 118(11), 2021.
[7]
B Brindza. On s-integral solutions of the equation ym = f (x). Acta Mathematica Hungarica, 44(1):133--139, 1984.
[8]
Nils Bruin and Michael Stoll. Deciding existence of rational points on curves: an experiment. Experimental Mathematics, 17(2):181--189, 2008.
[9]
Felipe Cucker, Pascal Koiran, and Steve Smale. A polynomial time algorithm for Diophantine equations in one variable. Journal of Symbolic Computation, 27(1):21--29, 1999.
[10]
Martin Davis, Hilary Putnam, and Julia Robinson. The decision problem for exponential Diophantine equations. Annals of Mathematics, 74:425--436, 1961.
[11]
Orrin Frink. Almost Pythagorean triples. Mathematics Magazine, 60(4):234--236, 1987.
[12]
William Gasarch. Hilbert's tenth problem: Refinements and variations. arXiv preprint arXiv:2104.07220, 2021.
[13]
William Gasarch. Hilbert's tenth problem: Refinements and variations. SIGACT News, 52(2), 2021.
[14]
William Gasarch. Hilbert's tenth problem for fixed d and n. Bulletin of EATCS, 1(133), 2021. ACM SIGACT News 55 March 2022, vol. 53, no. 1
[15]
Josef Gebel, A Peth¨o, and Horst G Zimmer. On Mordells equation. Compositio Mathematica, 110(3):335--367, 1998.
[16]
Bogdan Grechuk. Diophantine equations: a systematic approach. arXiv preprint arXiv:2108.08705, 2021.
[17]
Bogdan Grechuk. Can you solve the listed smallest open Diophantine equations? https:// mathoverflow.net/questions/400714/, 2021 (accessed December 31, 2021).
[18]
Bogdan Grechuk. On the smallest open Diophantine equations: beyond Hilbert's 10 problem. https: //mathoverflow.net/questions/411958/, 2021 (accessed December 31, 2021).
[19]
Bogdan Grechuk. Find all integer solutions to the following easy-looking Diophantine equations. https://mathoverflow.net/questions/414216/, 2022 (accessed January 21, 2022).
[20]
Sachi Hashimoto and Travis Morrison. Chabauty-coleman computations on rank 1 picard curves. arXiv preprint arXiv:2002.03291, 2020.
[21]
Ju V Matijasevic. Enumerable sets are Diophantine. In Soviet Math. Dokl., volume 11, pages 354--358, 1970.
[22]
Jeffrey CP Miller and Michael FCWoollett. Solutions of the Diophantine equation: x3 +y3 +z3 = k. Journal of the London Mathematical Society, 1(1):101--110, 1955.
[23]
LJ Mordell. On the integer solutions of the equation x2 +y2 +z2 +2xyz = n. Journal of the London Mathematical Society, 1(4):500--510, 1953.
[24]
Louis Joel Mordell. Diophantine equations. Academic Press, 1969.
[25]
Lisa Piccirillo. The Conway knot is not slice. Ann. of Math., 191(2):581--591, 2020.
[26]
Dimitrios Poulakis. Points entiers sur les courbes de genre 0. Colloquium Mathematicae, 66(1):1--7, 1993.
[27]
Dimitrios Poulakis and Evaggelos Voskos. Solving genus zero Diophantine equations with at most two infinite valuations. Journal of Symbolic Computation, 33(4):479--491, 2002.
[28]
Carl Runge. Ueber ganzzahlige l¨osungen von gleichungen zwischen zwei ver¨anderlichen. Journal fur die reine angewandte Mathematik, 1887.
[29]
Carl L Siegel. U¨ ber einige anwendungen diophantischer approximationen. Sitzungsberichte der Preussischen Akademie der Wissenschaften, 1:14--72, 1929.
[30]
Thoralf Skolem. Diophantische gleichungen. Berlin, 1938.
[31]
Roel Stroeker and Nikolaus Tzanakis. Computing all integer solutions of a genus 1 equation. Mathematics of computation, 72(244):1917--1933, 2003.
[32]
Leonid Vaserstein. Polynomial parametrization for the solutions of Diophantine equations and arithmetic groups. Annals of mathematics, pages 979--1009, 2010. ACM SIGACT News 56 March 2022, vol. 53, no. 1
[33]
P Walsh. A quantitative version of Runge's theorem on Diophantine equations. Acta Arithmetica, 62:157--172, 1992.
[34]
Frits Beukers and Szabolcs Tengely An implementation of Runge's method for Diophantine equations. arXiv preprint arXiv:math/0512418, 2005.
[35]
AndrewWiles. Modular elliptic curves and Fermat's last theorem. Annals of mathematics, 141(3):443-- 551, 1995.
[36]
Zidane. What is the smallest unsolved Diophantine equation? https://mathoverflow.net/ questions/316708/, 2018 (accessed June 12, 2020).
[37]
Paul Zimmermann, Alexandre Casamayou, Nathann Cohen, Guillaume Connan, Thierry Dumont, Laurent Fousse, Franc¸ois Maltey, Matthias Meulien, Marc Mezzarobba, Cl´ement Pernet, et al. Computational mathematics with SageMath. SIAM, 2018.

Cited By

View all
  • (2023)Diophantine equations with three monomialsJournal of Number Theory10.1016/j.jnt.2023.06.011253(69-108)Online publication date: Dec-2023

Index Terms

  1. On the smallest open Diophantine equations
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGACT News
      ACM SIGACT News  Volume 53, Issue 1
      March 2022
      77 pages
      ISSN:0163-5700
      DOI:10.1145/3532737
      Issue’s Table of Contents
      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 20 April 2022
      Published in SIGACT Volume 53, Issue 1

      Check for updates

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)12
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 06 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)Diophantine equations with three monomialsJournal of Number Theory10.1016/j.jnt.2023.06.011253(69-108)Online publication date: Dec-2023

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media