Efficient Algorithms for Computing Nœther Normalization

DOI10.1007/978-3-540-87827-8_8MaRDI QIDQ3597984zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the computation of Noether normalization
• Geometric complexity theory. V: Efficient algorithms for Noether normalization
• scientific article; zbMATH DE number 4101329
• Explicit Noether normalization for simultaneous conjugation via polynomial identity testing
• Algorithms for normalization of Hamiltonian systems by means of computer algebra
• scientific article; zbMATH DE number 1256647
• Noether normalization guided by monomial cone decompositions
• Computation of normal forms via a perturbation technique
• Practical normal form computations for vector fields
• scientific article; zbMATH DE number 1263324

Cites work

• scientific article; zbMATH DE number 1726532 (Why is no real title available?)
• scientific article; zbMATH DE number 4101329 (Why is no real title available?)
• scientific article; zbMATH DE number 177873 (Why is no real title available?)
• scientific article; zbMATH DE number 1302473 (Why is no real title available?)
• scientific article; zbMATH DE number 503187 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 1131487 (Why is no real title available?)
• Computation of Hilbert functions
• Computing the Castelnuovo-Mumford regularity of some subschemes of \(\mathbb{P}_K^n\) using quotients of monomial ideals
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Modular algorithms for computing Gröbner bases.
• On lucky ideals for Gröbner basis computations
• SINGULAR
• Saturation and Castelnuovo-Mumford regularity
• The Projective Noether Maple Package: Computing the dimension of a projective variety

Cited in

(9)

• scientific article; zbMATH DE number 4101329 (Why is no real title available?)
• A probabilistic approach to systems of parameters and Noether normalization
• Deterministic normal position transformation and its applications
• On the computation of Noether normalization
• Nœther bases and their applications
• Noether normalization guided by monomial cone decompositions
• About Gordan's algorithm for binary forms
• Covariant algebra of the binary nonic and the binary decimic
• Geometric complexity theory. V: Efficient algorithms for Noether normalization

Describes a project that uses

Uses Software

• noether.lib
• SINGULAR
• Projective Noether

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

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