An efficient implementation for computing Gröbner bases over algebraic number fields

DOI10.1007/11832225_9MaRDI QIDQ5747802zbMATH OpenOpenAlexFDO

Authors Masayuki Noro

Publication date 14 September 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11832225_9

zbMATH Keywords

Buchberger's algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• Gröbner bases in orders of algebraic number fields.
• scientific article; zbMATH DE number 2151220
• Computing Gröbner bases of ideal in \(\mathbb Z[\alpha] [x_1,\cdots, x_n]\) over \(\mathbb Z\)
• scientific article; zbMATH DE number 62658
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases

Cited in

(9)

• Dense Arithmetic over Finite Fields with the CUMODP Library
• scientific article; zbMATH DE number 1241621 (Why is no real title available?)
• scientific article; zbMATH DE number 5926987 (Why is no real title available?)
• On singularities of real algebraic sets and applications to kinematics
• An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
• Effective computation of strong Gröbner bases over Euclidean domains
• On the Complexity of Linear Algebra Operations over Algebraic Extension Fields
• scientific article; zbMATH DE number 1163437 (Why is no real title available?)
• Compact representation of polynomials for algorithms for computing Gröbner and involutive bases

Describes a project that uses

Uses Software

• Risa/Asir

This page was built for publication: An efficient implementation for computing Gröbner bases over algebraic number fields

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