MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

Among other things, he proves, for general $f,g$ such that f$with degree$f^m=g^n=h$would in particular require making a complete list of d \geq 3$, that $h$ which can be embedded into a continuous iteration semigroup \mu_f=\mu_g$implies that$\{h_t: t>0, h_1=h\}$($f$f$ and $g$ are then iterational roots, aka fractional iterates, of $h$ of suitable orders). This problem is very hard indeed, and special cases are still being investigated share an iterate (e.g. in numerous papers on "analytic iteration"). Some material can be found in the monograph MR1067720 (92f:39002) Kuczma, Marek; Choczewski, Bogdan; Ger, Roman Iterative functional equations.Encyclopedia of Mathematics and its Applications, 32. Cambridge University Press, Cambridge, 1990. xx+552 ppconverse is well known). ISBN: 0-521-35561-3
Re question 3: if The symbol $f$ and \mu_f$denotes the unique$g$are iterational roots f$-invariant measure of maximal entropy for $h$ which embeds into a semigroup as above, then they would commute f$(by the "semigroup law"). But there may be other cases of commuting and similarly for$g$). He also analyzes generic maps with a common iterate. I am not aware of any particular results for rational degree$2$. The proof involves some holomorphic maps , but for formal power series from$t \in the complex plane sufficient conditions for commuting roots were established \mathbb{C}$to$f_t \in MR1331878 Reich, Ludwig Families \rm{Rat}_d$, the set of commuting formal power series, semicanonical forms and iterative roots. Polish-Austrian Seminar on Functional Equations and Iteration Theory (Cieszyn, 1994). Ann. Math. Sil. No. 8 (1994), 189–201 rational functions of degree$d$(not semigroups, which you point out to be found here:http://www.sbc.org.pl/Content/34237/1994_15.pdf)impossible). As far as I can tell at the first glance, he does not seem to address the commutativity question. 1 Re question 1: a complete list of all pairs$f,g$such that$f^m=g^n=h$would in particular require making a complete list of$h$which can be embedded into a continuous iteration semigroup $\{h_t: t>0, h_1=h\}$ ($f$and$g$are then iterational roots, aka fractional iterates, of$h$of suitable orders). This problem is very hard indeed, and special cases are still being investigated (e.g. in numerous papers on "analytic iteration"). Some material can be found in the monograph MR1067720 (92f:39002) Kuczma, Marek; Choczewski, Bogdan; Ger, Roman Iterative functional equations. Encyclopedia of Mathematics and its Applications, 32. Cambridge University Press, Cambridge, 1990. xx+552 pp. ISBN: 0-521-35561-3 Re question 3: if$f$and$g$are iterational roots of$h\$ which embeds into a semigroup as above, then they would commute (by the "semigroup law"). But there may be other cases of commuting maps with a common iterate. I am not aware of any particular results for rational maps, but for formal power series in the complex plane sufficient conditions for commuting roots were established in MR1331878 Reich, Ludwig Families of commuting formal power series, semicanonical forms and iterative roots. Polish-Austrian Seminar on Functional Equations and Iteration Theory (Cieszyn, 1994). Ann. Math. Sil. No. 8 (1994), 189–201 (to be found here: http://www.sbc.org.pl/Content/34237/1994_15.pdf)