Consider now the standardized Okubo problem ˜p′(y)(y\boldmathI−% \boldmathT)=˜p(y)\boldmathU with U defined in (35), and \boldmathT=T++¯ρ\boldmathL, where
The complexity of the algorithms below depends on the (maximum) complexity O(C(par)w(n)) of the solution to the word problem in the parabolic subgroups. Some algorithms use the solution to the conjugacy problem in the parabolic subgroups; we denote …
The statement of Theorem 5.6 can be contrasted with the case when one considers torsion-free fully residually-H groups, where H is the class of hyperbolic groups, see Proposition 6.4 below.
Again, I am thankful to the discussants for their insightful comments. I also wish to thank the guest editor, Partha Lahiri, for inviting me to submit this paper to Statistical Science. This work was supported by a research grant from the Natural Sc…
This research was supported by a grant from the Natural Sciences and Engineering Research Council of Canada. My thanks are due to an associate editor and two referees for constructive comments and suggestions.
There aren't more papers