Skip to Main content Skip to Navigation
Journal articles

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

Chenqi Mou 1, 2, * Dongming Wang 2 Xiaoliang Li 3
* Corresponding author
2 PolSys - Polynomial Systems
Inria Paris-Rocquencourt, LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.sorbonne-universite.fr/hal-00765840
Contributor : Chenqi Mou <>
Submitted on : Monday, December 17, 2012 - 5:42:30 AM
Last modification on : Friday, January 8, 2021 - 5:42:02 PM

Links full text

Identifiers

Citation

Chenqi Mou, Dongming Wang, Xiaoliang Li. Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case. Theoretical Computer Science, Elsevier, 2013, 468, pp.102-113. ⟨10.1016/j.tcs.2012.11.009⟩. ⟨hal-00765840⟩

Share

Metrics

Record views

462