Factoring polynomials over function fields (2021)
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional restrictions, e.g., to find all roots that belong to a given finite dimensional k-subspace of K more efficiently. It also provides a deterministic polynomial time irreducibility test in small characteristic. We also discuss some applications.
CitationVoloch JF Factoring polynomials over function fields.
This citation is automatically generated and may be unreliable. Use as a guide only.
Keywordspolynomial factorization; function fields; irreducibility test
ANZSRC Fields of Research49 - Mathematical sciences::4904 - Pure mathematics::490401 - Algebra and number theory
RightsAll rights reserved unless otherwise stated
Showing items related by title, author, creator and subject.
The performance of available methods for computing the polynomial coefficients of the quadratic function approximation is evaluated. By comparing the numerical results to those obtained by symbolic methods, for a variety of functions, the direct solution of the matrix equation and a variety of recursive algorithms are all shown to be numerically unstable. AMS classification Balakrishnan, Easwaran; McInnes, A.W. (University of Canterbury. Mathematics, 1991)The performance of available methods for computing the polynomial coefficients of the quadratic function approximation is evaluated. By comparing the numerical results to those obtained by symbolic methods, for a variety ...
Shparlinski IE; Voloch JF (2018)We obtain a new lower bound on the size of value set V (ƒ) = ƒ(Fp) of a sparse polynomial ƒ ϵ Fp[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some ...
Powell, Michael James David (University of Canterbury. Dept. of Mathematics, 1989)It is known that multiquadric radial basis function approximations can reproduce low order polynomials when the centres form an infinite regular lattice. We make a start on the interesting question of extending this ...