Computing the radical of an ideal in positive characteristic

DOI10.1006/jsco.2001.0446zbMath1028.13010OpenAlexW2032308974WikidataQ57735050 ScholiaQ57735050MaRDI QIDQ5945292

Ryutaroh Matsumoto

Publication date: 10 October 2001

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0446

zbMATH Keywords

characteristic \(p\)polynomial ringBuchberger's algorithmcomputing the radicalGröbner basis conversion algorithm

Mathematics Subject Classification ID

Related Items (7)

Computing generators of the ideal of a smooth affine algebraic variety ⋮ Implementation of prime decomposition of polynomial ideals over small finite fields ⋮ Quantum automata and algebraic groups ⋮ Computing invariants of algebraic groups in arbitrary characteristic ⋮ Derivations and radicals of polynomial ideals over fields of arbitrary characteristic ⋮ Normalization of rings ⋮ The calculation of radical ideals in positive characteristic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hilbert functions and the Buchberger algorithm
• Basic principles of mechanical theorem proving in elementary geometries
• Gröbner bases and primary decomposition of polynomial ideals
• Direct methods for primary decomposition
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• An elimination method for polynomial systems
• Converting bases with the Gröbner walk
• On the walk
• A fast algorithm for Gröbner basis conversion and its applications
• Square-free algorithms in positive characteristic
• Lifting standard bases in filtered structures
• Unmixed and prime decomposition of radicals of polynomial ideals
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman

This page was built for publication: Computing the radical of an ideal in positive characteristic