相关论文: The geodesic complexity of n-dimensional Klein bot…

We introduce a new complexity measure of a path of (problems, solutions) pairs in terms of the length of the path in the condition metric which we define in the article. The measure gives an upper bound for the number of Newton steps…

We define an invariant, which we call surface-complexity, of closed 3-manifolds by means of Dehn surfaces. The surface-complexity of a manifold is a natural number measuring how much the manifold is complicated. We prove that it fulfils…

In this survey article we gather classical as well as recent results on minimal geodesics of Riemannian or Finsler metrics, giving special attention to the two-dimensional case. Moreover, we present open problems together with some first…

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

We will prove a decomposition for Wasserstein geodesics in the following sense: let $(X,d,m)$ be a non-branching metric measure space verifying $\mathsf{CD}_{loc}(K,N)$ or equivalently $\mathsf{CD}^{*}(K,N)$. We prove that every geodesic…

Aim of this paper is to prove the second order differentiation formula along geodesics in compact $RCD^*(K,N)$ spaces with $N<\infty$. This formula is new even in the context of Alexandrov spaces. We establish this result by showing that…

The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein in earlier work, and, unless the lens space is L(3,1), a layered triangulation with the minimal number of tetrahedra was shown to be unique and termed…

Geodesics on Riemannian manifolds are precisely the locally length-minimizing curves, but their explicit description via simple functions is rarely possible. Geodesics of the simplest form, such as lines on Euclidean space and great circles…

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…

We show that the geodesic diameter of a polygonal domain with n vertices can be computed in O(n^4 log n) time by considering O(n^3) candidate diameter endpoints; the endpoints are a subset of vertices of the overlay of shortest path maps…

Volume is a natural measure of complexity of a Riemannian manifold. In this survey, we discuss the results and conjectures concerning n-dimensional hyperbolic manifolds and orbifolds of small volume.

In this paper, by modifying the argument shift method,we prove Liouville integrability of geodesic flows of normal metrics (invariant Einstein metrics) on the Ledger-Obata $n$-symmetric spaces $K^n/\diag(K)$, where $K$ is a semisimple…

In this note we give a construction of a smooth Riemannian metric on R^n which is standard Euclidean outside a compact set K and such that it has N = n(n + 1)=2 invisible directions, meaning that all geodesics lines passing through the set…

We show that the number of marked minimal models of an n-dimensional smooth complex projective variety of general type can be bounded in terms of its volume, and, if n=3, also in terms of its Betti numbers. For an n-dimensional projective…

Let the complexity of a closed manifold M be the minimal number of simplices in a triangulation of M. Such a quantity is clearly submultiplicative with respect to finite coverings, and by taking the infimum on all finite coverings of M…

We introduce \emph{local Urysohn width}, a complexity measure for classification problems on metric spaces. Unlike VC dimension, fat-shattering dimension, and Rademacher complexity, which characterize the richness of hypothesis…

The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with…

We study the Crofton's formula in the Lorentzian AdS$_3$ and find that the area of a generic space-like two dimensional surface is given by the flux of space-like geodesics. The "complexity=volume" conjecture then implies a new holographic…

Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid $R\rightrightarrows X$ with finite stabilizer to be the length of…

Suppose $M$ is a complete, non-compact $n$-dimensional Riemannian manifold with locally convex ends and finite volume. We prove that $M$ admits a non-trivial geodesic net with one vertex, at most $(n+2)(n+1)/2$ edges, and total length at…