On some algebraic properties of generalised Chebyshev polynomials

From MaRDI portal





Generalised Chebyshev polynomials (GCP) are considered in the theory of so-called dessins d'enfant. By definition a complex polynomial \(P\) is called a generalised Chebyshev polynomial if for some \(c_+\) and \(c_-\) the inverse image of the interval \([c_-, c_+]\) is a tree. It is known that the definition is equivalent to a number of purely algebraic conditions. This makes it possible to define generalised Chebyshev polynomials over arbitrary fields and rings. In this note the author shows: Theorem 1. Let \(P\) be a generalised Chebyshev polynomial, where \(K\) is a field, \(\text{char}\, K = 0\), and \(P\) can be represented as \(P(z) = z^rS(z^k)\). Then either \(r = 0\), or \(k\) is even and \(r = k/2\). The theorem does not hold in a field \(F\) with \(\text{char}\,F>0\).











This page was built for publication: On some algebraic properties of generalised Chebyshev polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828529)