Quadratic counting of closed flat geodesic classes
Statement
Question 6.5.1 (Knieper). Suppose N (T ) grows subexponentially, i.e.
lim
T→∞
log N (T )
T = 0.
Is there a quadratic upper bound on N (T ), i.e., does there exist C > 0 such that
N (T ) ≤ C · T 2?
The answer is positive for the torus. One can also study this problem in the Finsler category. OPEN PROBLEMS AND QUESTIONS ABOUT GEODESICS 15
- Manifolds without conjugate points (rigidity conjectures)
There are many rigidity results for manifolds with non positive curvature that might extend to manifolds with no conjugate points. One still has the basic setting of a universal cover homeomorphic to Rn in which any two points are joined by a unique geodesic. However the convexity of the length of Jacobi fields, which is the basis of many arguments used in non positive curvature, is no longer available. Two major results of this nature are:
Theorem 7.0.2. A Riemannian metric with no conjugate points on a torus is flat.
Theorem 7.0.3. Let g be a complete Riemannian metric without conjugate points on the plane R2. Then for every point p
lim inf
r→∞
area B(p, r )
πr 2 ≥ 1,
with equality if and only if g is flat.
The two dimensional case of Theorem 7.0.2 was proved by E. Hopf [Hopf1948] and the general case by Burago and Ivanov [Bur-Iva1994]. The Lorentzian ana-logue of Theorem 7.0.2 is false; two dimensional counterexamples are constructed in [Bav-Mou2013]. Theorem 7.0.3 is a recent result of Bangert and Emmerich [Ban-Emm2013], which greatly improved on earlier results in [Bur-Kni1991] and [Ban-Emm2011]. Both results are easy for manifolds with non positive curvature but require subtle arguments in the context of no conjugate points. Bangert and Emmerich's work was motivated by the following conjecture, which they prove using their theorem:
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.