The calculation of radical ideals in positive characteristic

Authors:
Gregor Kemper
Affiliations:
IWR, Universität Heidelberg, Im Neuenheimer Feld 368, 69 120 Heidelberg, Germany
Venue:
Journal of Symbolic Computation
Year:
2002

Citing 11
Cited 4

Gröbner bases and primary decomposition of polynomial ideals

Journal of Symbolic Computation
Algebraic solution of systems of polynomial equations using Groebner bases

Proceedings of the 5th international conference, AAECC-5 on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Algorithms for computer algebra

Algorithms for computer algebra
Efficient computation of zero-dimensional Gro¨bner bases by change of ordering

Journal of Symbolic Computation
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
An algorithm for computing the integral closure

Journal of Symbolic Computation
Computing the Radical of an Ideal in Positive Characteristic

Journal of Symbolic Computation
Local Decomposition Algorithms

AAECC-8 Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
An Algorithm for the Computation of the Radical of an Ideal in the Ring of Polynomials

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Yet Another Ideal Decomposition Algorithm

AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Factorization over finitely generated fields

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation

An algorithm for the computation of the radical of an ideal

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Quantum automata and algebraic groups

Journal of Symbolic Computation
Conquering inseparability: Primary decomposition and multivariate factorization over algebraic function fields of positive characteristic

Journal of Symbolic Computation
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm for computing the radical of a polynomial ideal in positive characteristic. The algorithm does not involve polynomial factorization.