Efficient Algorithms for Computing Nœther Normalization

DOI10.1007/978-3-540-87827-8_8zbMath1166.68375OpenAlexW134993517MaRDI QIDQ3597984

Amir Hashemi

Publication date: 29 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_8

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)

Related Items (4)

Noether normalization guided by monomial cone decompositions ⋮ Covariant algebra of the binary nonic and the binary decimic ⋮ About Gordan's algorithm for binary forms ⋮ Nœther bases and their applications

Uses Software

• Projective Noether
• SINGULAR
• noether.lib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Computation of Hilbert functions
• On lucky ideals for Gröbner basis computations
• Modular algorithms for computing Gröbner bases.
• The Projective Noether Maple Package: Computing the dimension of a projective variety
• Saturation and Castelnuovo-Mumford regularity
• SINGULAR
• Computing the Castelnuovo-Mumford regularity of some subschemes of \(\mathbb{P}_K^n\) using quotients of monomial ideals

This page was built for publication: Efficient Algorithms for Computing Nœther Normalization