Related papers: One-dimensional Gromov minimal filling
In this article, we study the topological complexity of manifolds with a lower scalar curvature bound. We introduce a small scale index theorem to establish an upper bound for Gromov's simplicial norm of the Poincar\'e dual of the A-hat…
The goal of this article is to motivate and describe how Gromov-Witten theory can and has provided tools to understand the moduli space of curves. For example, ideas and methods from Gromov-Witten theory have led to both conjectures and…
Under an infinitesimal version of the Bishop-Gromov relative volume comparison condition for a measure on an Alexandrov space, we prove a topological splitting theorem of Cheeger-Gromoll type. As a corollary, we prove an isometric splitting…
The Steiner ratio characterizes the greatest possible deviation of the length of a minimal spanning tree from the length of the minimal Steiner tree. In this paper, estimates of the Steiner ratio on Riemannian manifolds are obtained. As a…
Geometric problems are usually formulated by means of (exterior) differential systems. In this theory, one enriches the system by adding algebraic and differential constraints, and then looks for regular solutions. Here we adopt a dual…
The first part of this work constructs positive-genus real Gromov-Witten invariants of real-orientable symplectic manifolds of odd "complex" dimensions; the present part focuses on their properties that are essential for actually working…
We give a very short and rather elementary proof of Gromov's filling volume inequality for n-dimensional Lipschitz cycles (with integer and Z_2-coefficients) in $L^\infty$-spaces. This inequality is used in the proof of Gromov's systolic…
We propose a new approach for unsupervised alignment of heterogeneous datasets, which maps data from two different domains without any known correspondences to a common metric space. Our method is based on an unbalanced optimal transport…
The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
Consider a real line equipped with a (not necessarily intrinsic) distance. We deal with the minimum-weight perfect matching problem for a complete graph whose points are located on the line and whose edges have weights equal to distances…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
We discuss topological theories, arising from the general $\mathcal{N}=2$ twisted gauge theories. We initiate a program of their study in the Gromov-Witten paradigm. We re-examine the low-energy effective abelian theory in the presence of…
This work investigates minimal parametric networks in hyperspaces of closed subsets of metric spaces endowed with the Hausdorff distance. It is shown that the problems of finding such networks are nontrivial only within finiteness classes,…
Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…
We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…
Nonlinear analysis has played a prominent role in the recent developments in geometry and topology. The study of the Yang-Mills equation and its cousins gave rise to the Donaldson invariants and more recently, the Seiberg-Witten invariants.…
We investigate the problem of designing a minimum cost flow network interconnecting n sources and a single sink, each with known locations in a normed space and with associated flow demands. The network may contain any finite number of…
We address two fundamental and well-known problems of Gromov and Lyndon: \demo{Problem A} (Gromov, see [5]). Consider a category $M_n$ of closed manifolds of dimension $n$ with nonzero-degree ways as morphisms. Study a partial order $M \ge…
We present an approach to Gromov-Witten invariants that works on arbitrary (closed) symplectic manifolds. We avoid genericity arguments and take into account singular curves in the very formulation. The method is by first endowing mapping…