A series of rotations – a discrete walk (or continuous path) in the manifold of the rotation group SO(3) or SU(2) – can of course be inverted (starting from the end, find a walk that returns to the beginning) by performing the steps in reverse. Eckmann et alshow that, for almost all walks, there is another way: starting at the end, perform the steps in the original order (1) twice, and (2) uniformly scaled by a factor.
Apparently – I haven’t read the article – the factor depends on the walk. (One would think the abstract would say if there were.) The theorem says there exists such a factor but not how to find it. As the factor varies from 0 on up, the end point of the twice traveled path, scaled by some factor, is dense in the rotation manifold. It isn’t surprising though the fact that the end of the once traveled path (scaled) is not dense, is.
If the authors cannot give a comparatively simple way to find the factor, or at least bounds on it, the theorem isn’t of much use. It looks like there is too much hype accompanying its announcement.
replies(2):