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

DOI10.1134/S000143462005017XMaRDI QIDQ2192154zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Inversion of ``modulo \(p\) reduction and a partial descent from characteristic 0 to positive characteristic
• Unlikely intersections and Pell's equations in polynomials
• The polynomial Pell equation
• Unlikely intersections in families of abelian varieties and the polynomial Pell equation
• Pell's equation

Cites work

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

Cited in

(1)

• Inversion of ``modulo \(p\) reduction and a partial descent from characteristic 0 to positive characteristic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2192154)