Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case

This paper presents an algorithm for decomposing any positive-dimensional polynomial set into simple sets over an arbitrary finite field. The algorithm is based on some relationship established between simple sets and radical ideals, reducing the decomposition problem to the problem of computing the radicals of certain ideals. In addition to direct application of the algorithms of Matsumoto and Kemper, the algorithm of Fortuna and others is optimized and improved for the computation of radicals of special ideals. Preliminary experiments with an implementation of the algorithm in Maple and Singular are carried out to show the effectiveness and efficiency of the algorithm.

[1]  Michael Francis Atiyah,et al.  Introduction to commutative algebra , 1969 .

[2]  Hans Schönemann,et al.  SINGULAR: a computer algebra system for polynomial computations , 2001, ACCA.

[3]  Patrizia M. Gianni,et al.  Derivations and Radicals of Polynomial Ideals over Fields of Arbitrary Characteristic , 2002, J. Symb. Comput..

[4]  Ryutaroh Matsumoto.  Computing the Radical of an Ideal in Positive Characteristic , 2001, J. Symb. Comput..

[5]  Banghe Li,et al.  An Algorithm for Transforming Regular Chain into Normal Chain , 2007, ASCM.

[6]  Kazuhiro Yokoyama,et al.  Implementation of prime decomposition of polynomial ideals over small finite fields , 2003, SIGS.

[7]  Michael Kalkbrener,et al.  A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties , 1993, J. Symb. Comput..

[8]  Chenqi Mou,et al.  Decomposing polynomial sets into simple sets over finite fields: The zero-dimensional case , 2010, Comput. Math. Appl..

[9]  N. Bose.  Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory , 1995 .

[10]  Evelyne Hubert,et al.  Notes on Triangular Sets and Triangulation-Decomposition Algorithms I: Polynomial Systems , 2001, SNSC.

[11]  Yang Lu.  Searching dependency between algebraic equations: an algorithm applied to automated reasoning , 1994 .

[12]  Allan K. Steel,et al.  Conquering inseparability: Primary decomposition and multivariate factorization over algebraic function fields of positive characteristic , 2005, J. Symb. Comput..

[13]  R. Tennant.  Algebra , 1941, Nature.

[14]  Patrizia M. Gianni,et al.  Properties of Gröbner bases under specializations , 1987, EUROCAL.

[15]  Wenjun Wu,et al.  Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.

[16]  Daniel Lazard,et al.  A new method for solving algebraic systems of positive dimension , 1991, Discret. Appl. Math..

[17]  Gregor Kemper.  The Calculation of Radical Ideals in Positive Characteristic , 2002, J. Symb. Comput..

[18]  Dongming Wang,et al.  Elimination Methods , 2001, Texts and Monographs in Symbolic Computation.

[19]  Zhenyu Huang,et al.  Characteristic set algorithms for equation solving in finite fields , 2012, J. Symb. Comput..

[20]  Heinz Kredel,et al.  Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .

[21]  Marc Moreno Maza,et al.  The RegularChains library in MAPLE , 2005, SIGS.

[22]  Dongming Wang,et al.  Computing Triangular Systems and Regular Systems , 2000, J. Symb. Comput..

[23]  Marc Moreno Maza,et al.  On the Theories of Triangular Sets , 1999, J. Symb. Comput..

[24]  Dongming Wang,et al.  Decomposing Polynomial Systems into Simple Systems , 1998, J. Symb. Comput..

[25]  A. Seidenberg.  Constructions in algebra , 1974 .

[26]  W. Wu.  ON ZEROS OF ALGEBRAIC EQUATIONS——AN APPLICATION OF RITT PRINCIPLE , 1986 .

[27]  Hornich.  Differential systems , 1941 .

[28]  Patrizia M. Gianni,et al.  Square-free algorithms in positive characteristic , 2005, Applicable Algebra in Engineering, Communication and Computing.

[29]  Vladimir P. Gerdt,et al.  Algorithmic Thomas decomposition of algebraic and differential systems , 2012, J. Symb. Comput..

[30]  Xiaoliang Li,et al.  Simple Decomposition of Polynomial Sets over Finite Fields , 2012 .

[31]  Antoine Joux,et al.  Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases , 2003, CRYPTO.