A combinatorial proof of simplified Kollár's theorem on Pell's equations

DOI10.1134/S000143462005017XzbMath1454.14103OpenAlexW3046327157MaRDI QIDQ2192154

Yanyan Li

Publication date: 29 June 2020

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000143462005017x

zbMATH Keywords

Pell's equationcommutative polynomial rings, algorithmic insolvability

Mathematics Subject Classification ID

Rational and ruled surfaces (14J26) Quadratic and bilinear Diophantine equations (11D09) Global ground fields in algebraic geometry (14G25) Affine fibrations (14R25) Multiplicative and norm form equations (11D57)

Cites Work

• Pell equations for polynomials
• Pell surfaces
• On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero
• The Diophantine Problem for Polynomial Rings and Fields of Rational Functions

This page was built for publication: A combinatorial proof of simplified Kollár's theorem on Pell's equations