Direct methods for primary decomposition

@article{Eisenbud1992DirectMF,
  title={Direct methods for primary decomposition},
  author={David Eisenbud and Craig Huneke and Wolmer V. Vasconcelos},
  journal={Inventiones mathematicae},
  year={1992},
  volume={110},
  pages={207-235}
}
SummaryLetI be an ideal in a polynomial ring over a perfect field. We given new methods for computing the equidimensional parts and radical ofI, for localizingI with respect to another ideal, and thus for finding the primary decomposition ofI. Our methods rest on modern ideas from commutative algebra, and are direct in the sense that they avoid the generic projections used by Hermann (1926) and all others until now.Some of our methods are practical for certain classes of interesting problems… 
Algorithms for Primary Decomposition
The primary decomposition methods of Eisenbud, Huneke and Vasconcelos are analysed in detail providing proofs of important theorems and all the corresponding algorithms are programmed in the language
Primary decomposition of zero-dimensional ideals over arbitrary fields
We present two algorithms to compute the primary decomposition of zero-dimensional ideals. The algorithms are deterministic and mainly use linear algebra techniques, based on the FGLM approach. This
An algorithm for primary decomposition in polynomial rings over the integers
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over
Primary Decomposition with Differential Operators
We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership is characterized by differential conditions. The minimal number of conditions needed is the
New Algorithms for Computing Primary Decomposition of Polynomial Ideals
  • M. Noro
  • Mathematics, Computer Science
    ICMS
  • 2010
TLDR
A new algorithm and its variant for computing a primary decomposition of a polynomial ideal based on the Shimoyama-Yokoyama algorithm can efficiently decompose some ideals which are hard to be decomposed by any of known algorithms.
Computing the Radical of an Ideal in Positive Characteristic
  • R. Matsumoto
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 2001
TLDR
This work proposes a method for computing the radical of an arbitrary ideal in the polynomial ring in n variables over a perfect field of characteristic p 0 and explains how to compute radicals over a finitely generated coefficient field over a field K.
Continuity Loci for Polynomial Systems
We consider the topology induced by Hausdorff distance on the pro- jective subvarieties of P m (C), the projective complex space of dimension m .W e construct the minimal stratification, for this
Localization and Primary Decomposition of Polynomial Ideals
TLDR
A new method for primary decomposition of a polynomial ideal, not necessarily zero-dimensional, is proposed and a detailed study for its practical implementation is reported on.
Decomposing Algebraic Varieties
  • Dongming Wang
  • Mathematics, Computer Science
    Automated Deduction in Geometry
  • 1998
TLDR
This paper explains how to adapt two general zero decomposition methods for efficient decomposition of affine algebraic varieties into unmixed and irreducible components.
A New Approach to Primary Decomposition
  • Alain Sausse
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 2001
TLDR
A new mathematical approach for the computation of an irredundant primary decomposition of a given polynomial ideal I and an implementation of this algorithm via a new software component, called The Central Control, developed inside the PoSSo European project.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 47 REFERENCES
Gröbner Bases and Primary Decomposition of Polynomial Ideals
TLDR
This work presents an algorithm to compute the primary decomposition of any ideal in a polynomialring over a factorially closed algorithmic principal ideal domain R and shows how the reduction process can be applied to computing radicals and testing ideals for primality.
Ideal Bases and Primary Decomposition: Case of Two Variables
  • D. Lazard
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 1985
A complete structure theorem is given for standard (= Grobner) bases for bivariate polynomials over a field and lexicographical orderings or for univariate polynomials over a Euclidian ring. An easy
Finding sparse systems of parameters
Abstract For several computational procedures such as finding radicals and Noether normalizations, it is important to choose as sparse as possible a system of parameters in a polynomial ideal or
The division algorithm and the hilbert scheme
In this thesis, a division algorithm is studied, following work of Macaulay, Hironaka, Buchberger, and others, which generalizes row reduction and the euclidean algorithm, in the same way that
What Can Be Computed in Algebraic Geometry
This paper evolved from a long series of discussions between the two authors, going backto around 1980, on the problems of mak ing effective computations in algebraic geometry, and it tookmore
Vanishing theorems, a theorem of Severi, and the equations defining projective varieties
In 1903 Severi [S] proved that if X, X' c P" are smooth surfaces whose union is the complete intersection of r 2 hypersurfaces of degrees di ... , dr-2, then hypersurfaces of degree k > Z di r cut
Commutative Algebra and Computer Algebra
TLDR
It will appear that most of the constructions which appear in classical commutative algebra can be done explicitely in finite time, however, there are exceptions.
Solving Zero-Dimensional Algebraic Systems
  • D. Lazard
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 1992
It is shown that a good output for a solver of algebraic systems of dimension zero consists of a family of ''triangular sets of polynomials''. Such an output is simple, readable and contains all
Effective computation of the integral closure of a morphism
Abstract Let B=k[y 1 ,…,y m ]/ p be an affine domain and let A be a finitely generated k-subalgebra of B. We provide direct methods to determine the integral closure of A in B. The tools are derived
Computing the integral closure of an affine domain
Let A = k[x, . .x , x,]/P be an affine domain over a field k, with P given by a set of generators. We give a method to find the defining ideal of its integral closure B as an affine domain B = k[y,
...
1
2
3
4
5
...