Irreducibility criteria for reciprocal polynomials and applications

dc.creatorCafure, Antonio Artemio
dc.creatorCesaratto, Eda
dc.date.accessioned2018-08-07T14:59:02Z
dc.date.available2018-08-07T14:59:02Z
dc.date.created2018-08-07T14:59:02Z
dc.date.issued2017-01
dc.identifierCafure, Antonio Artemio; Cesaratto, Eda; Irreducibility criteria for reciprocal polynomials and applications; Mathematical Association of America; The American Mathematical Monthly; 124; 1; 1-2017; 37-53
dc.identifier0002-9890
dc.identifierhttp://hdl.handle.net/11336/54414
dc.identifier1930-0972
dc.identifierCONICET Digital
dc.identifierCONICET
dc.description.abstractWe present criteria for determining irreducibility of reciprocal polynomials over the field of rational numbers. We also obtain some combinatorial results concerning the irreducibility of reciprocal polynomials. As a consequence of our approach, we are able to deal with other problems such as factorization properties of Chebyshev polynomials of the first and second kind and with the classical problems of computing minimal polynomials of algebraic values of trigonometric functions.
dc.languageeng
dc.publisherMathematical Association of America
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.4169/amer.math.monthly.124.1.37
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.tandfonline.com/doi/abs/10.4169/amer.math.monthly.124.1.37
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectReciprocal Polynomials
dc.subjectIrreducibility Over Q
dc.subjectChebyshev Polynomials
dc.titleIrreducibility criteria for reciprocal polynomials and applications
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución