Efficient Algorithms for Computing Nœther Normalization
From MaRDI portal
Publication:3597984
DOI10.1007/978-3-540-87827-8_8zbMath1166.68375MaRDI QIDQ3597984
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
68W30: Symbolic computation and algebraic computation
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Covariant algebra of the binary nonic and the binary decimic, Noether normalization guided by monomial cone decompositions, About Gordan's algorithm for binary forms, Nœther bases and their applications
Uses Software
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