Computation of the fundamental units of number rings using a generalized continued fraction

DOI10.1134/S036176881902004XzbMath1456.11126OpenAlexW2947757706WikidataQ127818844 ScholiaQ127818844MaRDI QIDQ2216908

Alexander D. Bruno

Publication date: 18 December 2020

Published in: Programming and Computer Software (Search for Journal in Brave)

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

zbMATH Keywords

generalized continued fractionDiophantine equations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Units and factorization (11R27) Continued fractions and generalizations (11J70) Continued fractions (11A55)

Related Items (1)

Computing unimodular matrices of power transformations

Uses Software

• Qhull

Cites Work

• Computation of the best Diophantine approximations and of fundamental units of algebraic fields
• The structure of multidimensional Diophantine approximations
• Two-way generalization of the continued fraction
• New generalization of continued fraction. I
• A further generalization of the continued fraction
• Parameterization of the discriminant set of a polynomial
• The quickhull algorithm for convex hulls
• Calculation of fundamental units of number rings by means of the generalized continued fraction
• Exact algorithms and software in optimization and polyhedral computation
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation of the fundamental units of number rings using a generalized continued fraction