zbMATH — the first resource for mathematics

The geometry of locally symmetric affine surfaces. (English) Zbl 1414.53029
Summary: We examine the local geometry of affine surfaces which are locally symmetric. There are six non-isomorphic local geometries. We realize these examples as type \(\mathcal {A}\), type \(\mathcal {B}\), and type \(\mathcal {C}\) geometries using a result of Opozda and classify the relevant geometries up to linear isomorphism. We examine the geodesic structures in this context. Particular attention is paid to the Lorentzian analogue of the hyperbolic plane and to the pseudosphere.

53C21 Methods of global Riemannian geometry, including PDE methods; curvature restrictions
Full Text: DOI arXiv
[1] Brozos-Vázquez, M.; García-Río, E.; Gilkey, P., Homogeneous affine surfaces: affine killing vector fields and gradient Ricci solitons, J. Math. Soc. Japan, 70, 25-70, (2018) · Zbl 1394.53021
[2] D’Ascanio, D.; Gilkey, P.; Pisani, P., Geodesic completeness for type \(\mathcal {A}\)A surfaces, Differential Geom. Appl., 54A, 31-43, (2017) · Zbl 1378.53048
[3] Koh, S., On affine symmetric spaces, Trans. Am. Math. Soc., 119, 291-309, (1965) · Zbl 0139.39502
[4] Nomizu, K., Invariant affine connections on homogeneous spaces, Am. J. Math., 76, 33-65, (1954) · Zbl 0059.15805
[5] Opozda, B., Affine versions of Singer’s theorem on locally homogeneous spaces, Ann. Glob. Anal. Geom., 15, 187-199, (1997) · Zbl 0881.53010
[6] Opozda, B., A classification of locally homogeneous connections on 2-dimensional manifolds, Differential Geom. Appl., 21, 173-198, (2004) · Zbl 1063.53024
[7] Pecastaing, V., On two theorems about local automorphisms of geometric structures, Ann. Inst. Fourier Grenoble, 66, 175-208, (2016) · Zbl 1417.53057
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.