If this subdivision rule is conformal in a certain sense, the group will be a 3-manifold group with the geometry of hyperbolic 3-space.
The proposed method relies on a well-known fact that the manifold of the group SE(3) is a Cartesian product of two manifold subgroups: the group of rotations SO(3) and the group of translations R3.
This kind of homogeneity means that, for every smooth Randers manifold (M,F), its group of isometries I(M,F) is acting transitively on M. The notion of naturally reductive Riemannian metrics was first introduced by Kobayashi and Nomizu[1].
This conjecture was partially solved by Grigori Perelman in his proof of the Geometrization conjecture, which states (in part) than any Gromov hyperbolic group that is a 3-manifold group must act geometrically on hyperbolic 3-space.
The class of Kobayashi-hyperbolic manifolds is rather important in complex geometry, and finding all manifolds with automorphism group of prescribed non-maximal dimension in this class was in fact our original motivation for studying general proper actions.
In Klein's approach each geometry is a (connected) manifold endowed with a group of automorphisms, that is, a Lie group \(G\) of "motions" that acts transitively on the manifold, such that two figures are regarded as congruent if and only if there exists an element of the appropriate Lie group \(G\) that transforms one of the figures into the other.
Bullet and other similar engines track a small group of manifold points that span the contact region and approximate a region of uniformly distributed contact force.
Each child SOM is trained to represent the distribution of a data class in a manifold, while the parent SOM generates a self-organizing map of the group of manifolds modeled by the child SOMs.
Also, 2-dimensional Riemannian manifolds with positive-dimensional group of isometries were to some extent described in [20], Theorem 5.1], [67].
A key idea is the introduction of a canonical connection, matching the manifold and group properties of the configuration space.
