On small solutions of the general nonsingular quadratic Diophantine equation in five or more unknowns-Reference-Cited by-同舟云学术

On small solutions of the general nonsingular quadratic Diophantine equation in five or more unknowns

Published:1990-03 Issue:2 Volume:107 Page:197-211
ISSN:0305-0041
Container-title:Mathematical Proceedings of the Cambridge Philosophical Society
language:en
Short-container-title:Math. Proc. Camb. Phil. Soc.

Author:

Kornhauser Daniel M.

Abstract

Matijaseviê [7] showed in 1970 that the problem of deciding whether an arbitrary Diophantine equation has an integer solution is algorithmically unsolvable. However, in 1972, Siegel [10] provided an algorithm for all equations of degree two.

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics

Reference14 articles.

1. Zur Theorie der quadratischen Formen;Siegel;Nachr. Akad. Wiss. Göttingen Math. –Phys. Kl.ll,1972

2. [6] Kornhauser D. M. . Bounds for the smallest integer solution of general quadratic equations. Ph.D. thesis, University of Michigan (1989).

3. How to solve a quadratic equation in integers

4. A New Application of the Hardy-Littlewood-Kloosterman Method

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective Estimates on Integral Quadratic Forms: Masser’s Conjecture, Generators of Orthogonal Groups, and Bounds in Reduction Theory;Geometric and Functional Analysis;2016-06

2. Heights and quadratic forms: Cassels’ theorem and its generalizations;Diophantine Methods, Lattices, and Arithmetic Theory of Quadratic Forms;2013

3. Polynomial bounds for equivalence of quadratic forms with cube-free determinant;Mathematical Proceedings of the Cambridge Philosophical Society;2007-11

4. Small Solutions of Quadratic Diophantine Equations;Proceedings of the London Mathematical Society;2003-05

5. How to Solve a Quadratic Equation In Rationals;Bulletin of the London Mathematical Society;1998-01