Computing the radical of an ideal in positive characteristic
From MaRDI portal
Publication:5945292
DOI10.1006/jsco.2001.0446zbMath1028.13010OpenAlexW2032308974WikidataQ57735050 ScholiaQ57735050MaRDI QIDQ5945292
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
characteristic \(p\)polynomial ringBuchberger's algorithmcomputing the radicalGröbner basis conversion algorithm
Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Characteristic (p) methods (Frobenius endomorphism) and reduction to characteristic (p); tight closure (13A35)
Related Items
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