An Alternative Method for Primary Decomposition of Zero-dimensional Ideals over Finite Fields

2011/12/28 by Yongbin Li, Li, Yongbin
Mathematics · #Commutative Algebra (math.AC) #FOS: Mathematics #Rings and Algebras (math.RA) #math.AC #math.RA

paper · pdf · doi:10.48550/arxiv.1112.6057

arxiv created 2012/07/14 · arxiv updated 2012/07/17

Abstract

We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the algorithm given by S. Gao, D. Wan and M. Wang in 2008, we get an alternative approach to compute all the primary components at once. As one example of our method, an improvement of Berlekamp's algorithm by theoretical considerations which computes the factorization of univariate polynomials over finite fields is also obtained.

Related

• An Algorithm to Decompose Permutation Representations of Finite Groups: Polynomial Algebra Approach
• An Algorithm to Compute a Primary Decomposition of Modules in Polynomial Rings over the Integers
• An algorithm for determining the irreducible polynomials over finite fields
• An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field
• A simplified version of the "Axis of Evil Theorem" for distinct points