Computation of the best Diophantine approximations and of fundamental units of algebraic fields

DOI10.1134/S1064562416030017zbMATH Open1353.11116OpenAlexW2471772418MaRDI QIDQ334388FDOQ334388

Authors: A. D. Bryuno 

Publication date: 1 November 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

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

Recommendations

• Computation of the fundamental units of number rings using a generalized continued fraction
• scientific article; zbMATH DE number 3948415
• From Diophantine approximations to Diophantine equations
• Publication:3029096
• On multidimensional Diophantine approximation of algebraic numbers

Mathematics Subject Classification ID

Units and factorization (11R27) Algebraic number theory computations (11Y40) Homogeneous approximation to one number (11J04)

Cites Work

• The quickhull algorithm for convex hulls
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New generalization of continued fraction. I
• Title not available (Why is that?)
• Universal generalization of the continued fraction algorithm
• Exact algorithms and software in optimization and polyhedral computation
• The structure of multidimensional Diophantine approximations

Cited In (3)

• Computation of the fundamental units of number rings using a generalized continued fraction
• On multidimensional Diophantine approximation of algebraic numbers
• From Diophantine approximations to Diophantine equations

This page was built for publication: Computation of the best Diophantine approximations and of fundamental units of algebraic fields

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