Gröbner bases and primary decomposition of polynomial ideals
Journal of Symbolic Computation
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
Converting bases with the Gröbner walk
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
The calculation of radical ideals in positive characteristic
Journal of Symbolic Computation
Efficient Multivariate Factorization over Finite Fields
AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Algebraic factoring and rational function integration
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Factorization over finitely generated fields
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Numerical primary decomposition
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Evaluation techniques for zero-dimensional primary decomposition
Journal of Symbolic Computation
Computing with algebraically closed fields
Journal of Symbolic Computation
Algorithms for computing triangular decomposition of polynomial systems
Journal of Symbolic Computation
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case
Theoretical Computer Science
Hi-index | 0.00 |
Algebraic function fields of positive characteristic are non-perfect fields, and many standard algorithms for solving some fundamental problems in commutative algebra simply do not work over these fields. This paper presents practical algorithms for the first time for (1) computing the primary decomposition of ideals of polynomial rings defined over such fields and (2) factoring arbitrary multivariate polynomials over such fields. Difficulties involving inseparability and the situation where the transcendence degree is greater than one are completely overcome, while the algorithms avoid explicit construction of any extension of the input base field. As a corollary, the problem of computing the primary decomposition of a positive-dimensional ideal over a finite field is also solved. The algorithms perform very effectively in an implementation within the Magma Computer Algebra System, and an analysis of their practical performance is given.