Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

CIE
2009
Springer

favoriteEmaildiscussreport

137views Applied Computing» more CIE 2009»

Decidability of Sub-theories of Polynomials over a Finite Field

13 years 11 months ago

Decidability of Sub-theories of Polynomials over a Finite Field

Download www.hausdorff-research-institute.uni-bonn.de

Abstract. Let Fq be a ﬁnite ﬁeld with q elements. We produce an (eﬀective) elimination of quantiﬁers for the structure of the set of polynomials, Fq[t], of one variable, in the language which contains symbols for addition, multiplication by t, inequalities of degrees, divisibility of degrees by a positive integer and, for each d ∈ Fq[t], a symbol for divisibility by d. We discuss the possibility of extending our results to the structure which results if one includes a predicate for the relation “x is a power of t”.

Alla Sirokofskich

Real-time Traffic

Applied Computing | CIE 2009 | Let Fq | Positive Integer | ﬁnite ﬁeld |

claim paper

Related Content

» Detecting Rational Points on Hypersurfaces over Finite Fields

» On Exponential Sums Nowton identities and Dickson Polynomials over Finite Fields

» Subquadratictime factoring of polynomials over finite fields

» Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation

» Finding roots of polynomials over finite fields

» Factoring Polynomials over Finite Fields using Balance Test

» Hensel lifting and bivariate polynomial factorisation over finite fields

» Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields

» Hardness of Reconstructing Multivariate Polynomials over Finite Fields

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CIE
Authors	Alla Sirokofskich

Comments (0)