Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Euclidean algorithm in imaginary abelian sextic number fields

From MaRDI portal
Publication:6127553
Jump to:navigation, search

DOI10.18311/JIMS/2024/29992MaRDI QIDQ6127553FDOQ6127553


Authors: Subramani Muthukrishnan, Usha Keshav Sangale Edit this on Wikidata


Publication date: 14 April 2024





Recommendations

  • Euclidean algorithm in Galois quartic fields
  • Euclidean algorithm in small abelian fields
  • The Euclidean algorithm for number fields and primitive roots
  • Generalized Euclidean algorithms
  • A computer algorithm for finding new Euclidean number fields


zbMATH Keywords

class numbernumber fieldsprimitive rootsEuclidean ringsnon-Wieferich primes


Mathematics Subject Classification ID

Algebraic numbers; rings of algebraic integers (11R04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)







This page was built for publication: Euclidean algorithm in imaginary abelian sextic number fields

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6127553&oldid=35582435"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 10 July 2024, at 06:27. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki