Efficient Algorithms for Computing Nœther Normalization
From MaRDI portal
Publication:3597984
DOI10.1007/978-3-540-87827-8_8zbMATH Open1166.68375OpenAlexW134993517MaRDI QIDQ3597984FDOQ3597984
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
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
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- Title not available (Why is that?)
- SINGULAR
- Title not available (Why is that?)
- Modular algorithms for computing Gröbner bases.
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- On lucky ideals for Gröbner basis computations
- Saturation and Castelnuovo-Mumford regularity
- Title not available (Why is that?)
- Computation of Hilbert functions
- Title not available (Why is that?)
- Computing the Castelnuovo-Mumford regularity of some subschemes of \(\mathbb{P}_K^n\) using quotients of monomial ideals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- 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
Uses Software
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)
