Computing the radical of an ideal in positive characteristic

Journal of Symbolic Computation

Volumn 32, Issue 3, 2001, Pages 263-271

  Matsumoto, Ryutaroh ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035193212     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2001.0446     Document Type: Article

References (20)

1. On the walk
2. On the computation of the radical of polynomial complete intersection ideals
3. Yet another algorithm for ideal decomposition
4. Converting bases with the Gröbner walk
5. Direct methods for primary decomposition
6. Efficient computation of zero-dimensional Gröbner bases by change of ordering
7. Square-free algorithms in positive characteristic
8. Gröbner bases and primary decomposition of polynomial ideals
9. An algorithm for the computation of the radical of an ideal in the ring of polynomials
10. A fast algorithm for Gröbner basis conversion and its applications
11. Hilbert functions and the Buchberger algorithm
12. An elimination method for polynomial systems
13. Unmixed and prime decomposition of radicals of polynomial ideals
14. Basic principles of mechanical theorem proving in elementary geometry
15. Basic principles of mechanical theorem proving in elementary geometry
16. Computations on determinantal ideals and normality check by Macaulay 2