Commuting polynomials and self-similarity (Q871316): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 01:26, 5 March 2024

scientific article
Language Label Description Also known as
English
Commuting polynomials and self-similarity
scientific article

    Statements

    Commuting polynomials and self-similarity (English)
    0 references
    0 references
    17 March 2007
    0 references
    As a corrolary of their studies of functions of a complex variable, between 1922 and 1924, Julia and Ritt obtained a classification of pairs of polynomials with complex coefficients which commute over composition; but their proof used topological and algebraic methods. In this paper the author comes back to this question using only very elementary techniques. Let \(F\) be an algebraically closed field of characteristic zero and \(f \in F[x]\) a polynomial of degree \(>1\). The author shows that the number of polynomials \(P\in F[x]\) of degree \(k\) which commute with \(f\) is either zero or equal to the number of linear polynomials in \(F[x]\) which commute with \(f\). As a corollary, he obtains a theorem of E.A. Bertram characterizing those polynomials commuting with a Chebyshev polynomial.
    0 references
    polynomial
    0 references
    field
    0 references
    Chebyshev polynomial
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references