Algorithm 1058: computing the group of local dyadic square-classes the easy way

DOI10.1145/3759246MaRDI QIDQ6892959zbMATH OpenFDO

Authors Przemysław Koprowski

Publication date 27 November 2025

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3759246

zbMATH Keywords

local fieldsnumber fieldssquare-class groupssquare-classes

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• Advanced Topics in Computional Number Theory
• Computing the multiplicative group of residue class rings
• Computing ray class groups, conductors and discriminants
• Computing the length of sum of squares and Pythagoras element in a global field
• Computing with quadratic forms over number fields
• Factoring polynomials over local fields. II
• scientific article; zbMATH DE number 2132158 (Why is no real title available?)
• scientific article; zbMATH DE number 1313469 (Why is no real title available?)
• scientific article; zbMATH DE number 1113824 (Why is no real title available?)
• scientific article; zbMATH DE number 1793794 (Why is no real title available?)
• Identifying the matrix ring: algorithms for quaternion algebras and quadratic forms
• Introduction to quadratic forms
• Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
• Quaternion algebras
• Rings of order p^5. II: Local rings
• The Magma algebra system. I: The user language

This page was built for publication: Algorithm 1058: computing the group of local dyadic square-classes the easy way

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