On the number of integer polynomials with multiplicatively dependent roots (Q1747969): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s10474-018-0788-9 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10474-018-0788-9 / rank
 
Normal rank

Latest revision as of 08:03, 11 December 2024

scientific article
Language Label Description Also known as
English
On the number of integer polynomials with multiplicatively dependent roots
scientific article

    Statements

    On the number of integer polynomials with multiplicatively dependent roots (English)
    0 references
    0 references
    0 references
    27 April 2018
    0 references
    Let \(f\in\mathbb{C}[X]\) be a complex polynomial. The height of \(f\) is the largest modulus of its coefficients. A polynomial of degree at least 2 is called degenerate if it has a pair of distinct nonzero roots whose quotient is a root of unity. Moreover \(f\) is called a generalized degenerate polynomial, if denoting by \(\alpha_1,\ldots,\alpha_t\) its distinct roots, there exist integers \(k_1,\ldots,k_t\) such that \(\alpha_1^{k_1}\ldots\alpha_t^{k_t}=1.\) The authors are obtaining results concerned with the estimation of the number of generalized degenerate polynomials of fixed degree and bounded height.
    0 references
    multiplicative dependence
    0 references
    degenerate polynomial
    0 references
    generalized degenerate polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references