Lifting of a Riemannian flag and Lie flags of the \(n+1\)-dimensional hyperbolic torus. (Relèvement d’un drapeau riemannien et drapeaux de Lie du tore hyperbolique \(n+1\)-dimensionnel.) (French) Zbl 1096.53032
The author shows that any flag of Riemannian foliations on a compact connected orientable Riemannian manifold lifts on the bundle of transverse direct orthonormal frames to a flag of transversally parallelizable foliations. This result permits to obtain a classification of \((n+ 1)\)-dimensional compact orientable Riemannian manifolds for which the dimension of the structural Lie algebra of the flow is equal to \(n\) or \(n-1\).
Reviewer: Włodzimierz Waliszewski (Łódź)
References:
| [1] | Alaoui, A. El Kacimi; Nicolau, M., A class of \({C}^{\infty }\) stable foliations, Ergod. Th. and Dynam. Sys., 13, 667-704 (1993) · Zbl 0801.58038 · doi:10.1017/S0143385700007628 |
| [2] | Almeida, R.; Molino, P., Flots Riemanniens sur les 4-variétés compactes, Tôhoku Mathematical Journal, 38, 313-326 (1986) · Zbl 0603.57017 · doi:10.2748/tmj/1178228496 |
| [3] | Bossoto, B.; Diallo, H., Sur les drapeaux de feuilletages riemanniens, JP Journal of Geometry and Topology, University of Allahabad, INDIA, 2, 281-288 (2002) |
| [4] | Diallo, H., Sur les drapeaux de Lie, Afrika Mathematika, 13, 75-86 (2002) · Zbl 1044.57010 |
| [5] | Fédida, E., Feuilletages du plan. Feuilletages de Lie (1973) · Zbl 0218.57014 |
| [6] | Molino, P., Géométrie globale des feuilletages riemanniens, Proc. Kon. Nederland Akad Ser. A, 85, 45-76 (1982) · Zbl 0516.57016 |
| [7] | Carrière, Y., Flots riemanniens, Structures transverses des feuilletages, Astérisque, 116, 31-52 (1984) · Zbl 0548.58033 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
