Related papers: Minimal horizontal triods: Analysis and computatio…
Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…
We construct a one-parameter family of properly embedded minimal annuli in the Heisenberg group Nil_3 endowed with a left-invariant Riemannian metric. These annuli are not rotationally invariant. This family gives a vertical half-space…
Analysis of complex networks, particularly material networks such as the carbon skeleton of hydrocarbons generated in hydrocarbon pyrolysis in carbon-rich systems, is essential for effectively describing, modeling, and predicting their…
In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…
Hypergraphs are a useful abstraction for modeling multiway relationships in data, and hypergraph clustering is the task of detecting groups of closely related nodes in such data. Graph clustering has been studied extensively, and there are…
We study networks in $\R^n$ which are periodic under a lattice of rank~$n$ and have vertices of prescribed degree $d\ge 3$. We minimize the length of the quotient networks, subject to the constraint that the fundamental domain has…
In this paper, we study some basic geometric properties of pseudohermitian submanifolds of the Heisenberg groups. In particular, we obtain the uniqueness and existence theorems, and some rigidity theorems.
In this paper, we give a necessary and sufficient condition for a graphical strip in the Heisenberg group $\mathbb{H}$ to be area-minimizing in the slab $\{-1<x<1\}$. We show that our condition is necessary by introducing a family of…
We show that if X is a minimal length carrier graph in a hyperbolic 3-manifold, M, then if X contains a sufficiently short edge, it must contain a short circuit, as well. The meaning of "short" depends only on the rank of the fundamental…
We present new computations of approximately length-minimizing polygons with fixed thickness. These curves model the centerlines of "tight" knotted tubes with minimal length and fixed circular cross-section. Our curves approximately…
We prove that Hausdorff limit of topological minimal sets (with finitely generated coefficient group) are topologically minimal. The key idea is to reduce the homology group on the space to the homology group on the sphere, and reduce the…
Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some…
We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \emph{terminals} in $\R^d$, find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line…
The main purpose of the paper is to develop an approach to evaluation or estimation of the spanning tree congestion of planar graphs. This approach is used to evaluate the spanning tree congestion of triangular grids.
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
We study the local equivalence problems of curves and surfaces in three dimensional Heisenberg group via Cartans method of moving frames and Lie groups, and find a complete set of invariants for curves and surfaces. For surfaces, in terms…
In recent work, the second and third authors introduced a technique for reachability checking in 1-bounded Petri nets, based on wiring decompositions, which are expressions in a fragment of the compositional algebra of nets with boundaries.…
We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…
We investigate minimal surfaces passing a given curve in $R^{3}$. Using the Frenet frame of a given curve and isothermal parameter, we derive the necessary and sufficient condition for minimal surface. Also we derive the parametric…
We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a…