Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case - Sorbonne Université Access content directly
Journal Articles Theoretical Computer Science Year : 2013

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

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.

Dates and versions

hal-00765840 , version 1 (17-12-2012)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More