ON RITT'S POLYNOMIAL DECOMPOSITION THEOREMS
By Michael E. Zieve, Peter Mueller. 2008
53 citations recorded by the source corpus.
Ritt studied the functional decomposition of a univariate complex polynomial f into prime (indecomposable) polynomials, f = u1 ◦ u2 ◦ � � � ◦ ur. His main achievement was a procedure for obtaining any decomposition of f from any other by repeatedly applying certain transformations. However, Ritt's results provide no control on the num- ber of times one must apply the basic transformations, which makes his procedure unsuitable for many theoretical and algorithmic applications. We solve this problem by giving a new description of the collection of all decompositions of a polynomial. One consequence is as follows: if f has degree n > 1 but f is not conjugate by a linear polynomial to either X n or ±Tn (with Tn the Chebychev polynomial), and if the composition a ◦ b of polynomials a, b is the k th iterate of f for some k > log2(n + 2), then either a = f ◦ c or b = c ◦ f for some polynomial c. This result has been used by Ghioca, Tucker and Zieve to describe the polynomials f, g having orbits with infinite intersection; our results have also been used by Medevedev and Scanlon to describe the affine curves invari- ant under a coordinatewise polynomial action. Ritt also proved that the sequence (deg(u1), . . . ,deg(ur)) is uniquely determined by f, up to permutation. We show that in fact, up to permutation, the sequence of permutation groups (G(u1), . . . , G(ur)) is uniquely determined by f, where G(u) = Gal(u(X)−t, C(t)). This generalizes both Ritt's invariant and an invariant discovered by Beardon and Ng, which turns out to be equivalent to the subsequence of cyclic groups among the G(ui).
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/457d2a05a9ddf6caf05b4e90e832fe9cf07c778a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
In Geometry and Topology
Citations in the corpus
- Linear relations between polynomial orbits (2008, unknown): “The proof of this result relies on the full strength of the new description given in [29] for the collection of all decompositions of a polynomial; this in turn depends on the classical results of Ritt [23] among other things.”
- Invariant varieties for polynomial dynamical systems (2009, methodology): “What we call decompositions are called “complete decompositions” in the literature (see, for example, [21]).”