相关论文: One-dimensional Gromov minimal filling
The embedding of finite metrics in $\ell_1$ has become a fundamental tool for both combinatorial optimization and large-scale data analysis. One important application is to network flow problems in which there is close relation between…
Estimation of Markov Random Field and covariance models from high-dimensional data represents a canonical problem that has received a lot of attention in the literature. A key assumption, widely employed, is that of {\em sparsity} of the…
We investigate the geometry of the family $\cal M$ of isometry classes of compact metric spaces, endowed with the Gromov-Hausdorff metric. We show that sufficiently small neighborhoods of generic finite spaces in the subspace of all finite…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
The inclusion of a flat metric tensor in gravitation permits the formulation of a gravitational stress-energy tensor and the formal derivation of general relativity from a linear theory in flat spacetime. Building on the works of Kraichnan…
In this paper we define and study pseudoholomorphic vector bundles structures, particular cases of which are tangent and normal bundle almost complex structures. These are intrinsically related to the Gromov D-operator. As an application we…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
This is the first part of a trilogy where we apply the theory of virtual manifold/orbifolds developed by the first named author and Tian to study the Gromov-Witten moduli spaces. In this paper, we resolve the main analytic issue arising…
We define the nonlinear part of a new filled section for Gromov-Witten theory in the setting of the usual Banach analysis rather than of ployfold theory and prove that the filled-section so defined is of class $C^1$.
The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We…
In this self-contained paper, we present a theory of the piecewise linear minimal valid functions for the 1-row Gomory-Johnson infinite group problem. The non-extreme minimal valid functions are those that admit effective perturbations. We…
For a general family of graphs on $\mathbb{Z}^n$, we translate the edge-isoperimetric problem into a continuous isoperimetric problem in $\mathbb{R}^n$. We then solve the continuous isoperimetric problem using the Brunn-Minkowski inequality…
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…
In [CKM17], Chodosh, Ketover, and Maximo proved finite diffeomorphism theorems for complete embedded minimal hypersurfaces of dimension $\leqslant$ 6 with finite index and bounded volume growth ratio. In this paper, we adapt their method to…
Given a set of $n$ points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum of Euclidean length of its edges. This incredibly challenging problem has been studied for more than…
This is a very brief report on recent developments on the Dirichlet problem for the minimal surface system and minimal cones in Euclidean spaces. We shall mainly focus on two directions: (1) Further systematic developments after…
The Euclidean Steiner tree problem, normally posed in two dimensions, seeks to connect a set of prescribed terminal nodes by placing additional nodes, known as Steiner points, with edges connecting such nodes either to another Steiner point…
The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…
A minimum dominating set in a graph is a minimum set of vertices such that every vertex of the graph either belongs to it, or is adjacent to one vertex of this set. This mathematical object is of high relevance in a number of applications…
This rather technical paper presents some generalization of the results of recent publications \cite{Shirkov2010, DVPF2010, PFDV2010} where toy models of dimensional reduction of space-time were considered. Here we introduce and consider a…