A Robust Implementation for Solving the S-Unit Equation and Several Applications

arXiv: Number Theory(2021)

Cited 4|Views11
No score
Abstract
Let K be a number field, and S a finite set of places in K containing all infinite places. We present an implementation for solving the S-unit equation x + y = 1, $$x,y \in \mathcal {O}_{K,S}^\times $$ in the computer algebra package SageMath. This paper outlines the mathematical basis for the implementation. We discuss and reference the results of extensive computations, including exponent bounds for solutions in many fields of small degree for small sets S. As an application, we prove an asymptotic version of Fermat’s Last Theorem for totally real cubic number fields with bounded discriminant where 2 is totally ramified. In addition, we use the implementation to find all solutions to some cubic Ramanujan-Nagell equations.
More
Translated text
Key words
robust implementation,solving,equation,s-unit
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined