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

Chenqi Mou 1, 2, * Dongming Wang 2 Xiaoliang Li 3
* Auteur correspondant
2 PolSys - Polynomial Systems
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2013, 468, pp.102-113. 〈10.1016/j.tcs.2012.11.009〉
Liste complète des métadonnées

http://hal.upmc.fr/hal-00765840
Contributeur : Chenqi Mou <>
Soumis le : lundi 17 décembre 2012 - 05:42:30
Dernière modification le : samedi 7 novembre 2015 - 01:06:06

Identifiants

Collections

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〉

Partager

Métriques

Consultations de la notice

310