Implementation of prime decomposition of polynomial ideals over small finite fields

DOI10.1016/J.JSC.2003.08.004MaRDI QIDQ2643560zbMATH OpenOpenAlexFDO

Authors Masayuki Noro, Kazuhiro Yokoyama

Publication date 24 August 2007

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

Full work available at URL https://doi.org/10.1016/j.jsc.2003.08.004

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 1860723
• Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
• An algorithm for primary decomposition in polynomial rings over the integers
• scientific article; zbMATH DE number 1273637
• New algorithms for computing primary decomposition of polynomial ideals
• scientific article; zbMATH DE number 1046429
• scientific article; zbMATH DE number 2124962
• Publication:4509882
• The Decomposition of a Rational Prime Ideal in Cyclotomic Fields
• scientific article; zbMATH DE number 177888

Cites work

• scientific article; zbMATH DE number 1302473 (Why is no real title available?)
• scientific article; zbMATH DE number 2077079 (Why is no real title available?)
• scientific article; zbMATH DE number 2077081 (Why is no real title available?)
• scientific article; zbMATH DE number 1795744 (Why is no real title available?)
• scientific article; zbMATH DE number 2151236 (Why is no real title available?)
• scientific article; zbMATH DE number 939804 (Why is no real title available?)
• scientific article; zbMATH DE number 1860723 (Why is no real title available?)
• A modular method to compute the rational univariate representation of zero-dimensional ideals
• An algorithm for computing the integral closure
• Computing the radical of an ideal in positive characteristic
• Constructions in Algebra
• Derivations and radicals of polynomial ideals over fields of arbitrary characteristic
• Direct methods for primary decomposition
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Generic polynomials with few parameters
• Gröbner bases and primary decomposition of polynomial ideals
• Lifting standard bases in filtered structures
• Localization and primary decomposition of polynomial ideals
• Prime decompositions of radicals in polynomial rings
• Solutions of systems of algebraic equations and linear maps on residue class rings
• Square-free algorithms in positive characteristic
• The calculation of radical ideals in positive characteristic

Cited in

(7)

• Usage of modular techniques for efficient computation of ideal operations
• Computing and using minimal polynomials
• A Direttissimo Algorithm for Equidimensional Decomposition
• Computing with algebraically closed fields
• Ideals modulo a prime
• scientific article; zbMATH DE number 1860723 (Why is no real title available?)
• An efficient algorithm for factoring polynomials over algebraic extension field

Describes a project that uses

Uses Software

• OpenXM

This page was built for publication: Implementation of prime decomposition of polynomial ideals over small finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643560)