Testing degenerate polynomials (Q429757): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00200-011-0150-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981339546 / rank | |||
Normal rank |
Revision as of 21:11, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Testing degenerate polynomials |
scientific article |
Statements
Testing degenerate polynomials (English)
0 references
20 June 2012
0 references
In this paper two algorithms are given for deciding whether a given integer polynomial \(P(X)\) has a pair of distinct roots \(\alpha,\beta\) such that \(\alpha/\beta\) is a root of unity. If this happens the polynomial is called \textit{degenerate}. The first algorithm consists of computing the resultant \(Q(X)=\text{Res}_Y(P(XY),P(Y))\) , and then factoring \(Q\) ( over \(\mathbb Q\)? -- presumably to see whether it has any cyclotomic factors \(\neq X-1\).) How these factors are to be detected is not specified, although in an example at the end of Section 5.1 this is done by computing the gcd of a polynomial \(A\) and its reciprocal \(A^*\). Of course this method works only if all (self)-reciprocal factors of \(A\) are cyclotomic. (It does not distinguish between cyclotomic factors and reciprocal noncyclotomic factors.) A second method computes \(P_k(X)=\text{Res}_Y(P(Y),Y^k-X)\) for \(k\) up to a bound guaranteed to find \(\alpha,\beta\) such that \(\alpha/\beta\) is a \(k\)th root of unity, if there is such a \(k\). In this case \(P_k\) will have repeated roots, detected by computing \(\gcd(P_k,P_k')\).
0 references
degenerate polynomials
0 references
Skolem-Mahler-Lech theorem
0 references
root of unity
0 references