Irreducibility criteria for reciprocal polynomials and applications
We 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 factor...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/54414 |
| Acceso en línea: | http://hdl.handle.net/11336/54414 |
| Access Level: | acceso abierto |
| Palabra clave: | Reciprocal Polynomials Irreducibility Over Q Chebyshev Polynomials https://purl.org/becyt/ford/1.1 https://purl.org/becyt/ford/1 |
| Sumario: | We 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. |
|---|