Estamos realizando la búsqueda. Por favor, espere...


On some classes of irreducible polynomials

Abstract: One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irreducible factors. The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form F(x,y)=f1(x)f2(y)-f2(x)f1(y), then F(x,y)+r is always irreducible for any constant r different from zero. We also provide the biggest known family of HIP polynomials in several variables. These are polynomials p(x1,---,xn)E K[x1,...,xn] over a zero characteristic field K such that p(h1(x1),..,hn(xn)) is irreducible over K for every n-tuple h1(x1),...,hn(xn) of non constant one variable polynomials over K. The results can also be applied to fields of positive characteristic, with some modifications.

 Autoría: Gutierrez J., Jiménez Urroz J.,

 Fuente: Journal of Symbolic Computation, 2021, 105, 64-70

Editorial: Elsevier

 Fecha de publicación: 01/07/2021

Nº de páginas: 7

Tipo de publicación: Artículo de Revista

 DOI: 10.1016/j.jsc.2019.08.005

ISSN: 0747-7171,1095-855X

Url de la publicación: https://doi.org/10.1016/j.jsc.2019.08.005