The calculation of radical ideals in positive characteristic

DOI10.1006/jsco.2002.0560zbMath1010.13001OpenAlexW2051998660MaRDI QIDQ1864889

Gregor Kemper

Publication date: 23 March 2003

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

Full work available at URL: https://semanticscholar.org/paper/1d28e121a3204cd76af8794bb69cea3f6f9a4969

zbMATH Keywords

computing the radical of a polynomial ideal

Mathematics Subject Classification ID

Related Items (8)

Computing generators of the ideal of a smooth affine algebraic variety ⋮ Implementation of prime decomposition of polynomial ideals over small finite fields ⋮ Computing the binomial part of a polynomial ideal ⋮ Quantum automata and algebraic groups ⋮ Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic ⋮ Computing invariants of algebraic groups in arbitrary characteristic ⋮ Asymptotically fast group operations on Jacobians of general curves ⋮ PERMUTATION POLYNOMIALS OF DEGREE 8 OVER FINITE FIELDS OF ODD CHARACTERISTIC

Uses Software

• CoCoA
• Macaulay2
• Magma
• SINGULAR

Cites Work

• 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
• The Magma algebra system. I: The user language
• Some features of \(CoCoA 3\)
• Constructions in Algebra
• On computing the integral closure
• An algorithm for computing the integral closure
• Computing the radical of an ideal in positive characteristic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The calculation of radical ideals in positive characteristic