Jürgen Jost
Max Planck Society
574 Papers
3.1K Citations
Jürgen Jost is an academic researcher from Max Planck Society. The author has contributed to research in topics: Harmonic map & Curvature. The author has an hindex of 59, co-authored 544 publications. Previous affiliations of Jürgen Jost include Santa Fe Institute & Australian National University.
Chat about Author
Papers
Partial regularity for a nonlinear sigma model with gravitino in higher dimensions
TL;DR: In this paper, the authors studied the regularity problem of the nonlinear sigma model with gravitino fields in higher dimensions and derived the Euler-Lagrange equations and showed that any weak solution is actually smooth under some smallness assumption for certain Morrey norms.
Harmonic maps and rigidity theorems for spaces of nonpositive curvature
Jürgen Jost,Shing-Tung Yau +1 more
TL;DR: In this paper, it was shown that the fundamental group of a compact Riemannian manifold M of nonpositive curvature has no center and splits as a product, and that M itself is metrically a product.
Universal bounds for eigenvalues of the polyharmonic operators
TL;DR: In this article, a universal inequality for the lower order eigenvalues of the polyharmonic operator on compact Riemannian manifolds with boundary (possibly empty) was shown.
From the Jordan Product to Riemannian Geometries on Classical and Quantum States.
TL;DR: It is proved that the Fisher–Rao metric tensor is recovered in the Abelian case, and that the Fubini–Study metric tensors is recovered when the authors consider pure states on the algebra B(H) of linear operators on a finite-dimensional Hilbert space H.
•Posted Content
Random walks and Laplacians on hypergraphs: When do they match?
TL;DR: In this article, a general theory of random walks on hypergraphs is developed, which includes, as special cases, the different models that are found in literature, and is compared to hypergraph normalized Laplacians that are not necessarily related to random walks, but are motivated by biological and chemical networks.