Related papers: Minimal horizontal triods: Analysis and computatio…
We consider surfaces immersed in three-dimensional pseudohermitian manifolds. We define the notion of (p-)mean curvature and of the associated (p-)minimal surfaces, extending some concepts previously given for the (flat) Heisenberg group.…
Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…
Motivated by results of Henry, Pralat and Zhang (PNAS 108.21 (2011): 8605-8610), we propose a general scheme for evolving spatial networks in order to reduce their total edge lengths. We study the properties of the equilbria of two networks…
Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a…
We consider a network in the Euclidean plane that consists of three distinct half-lines with common start points. From that network as initial condition, there exists a network that consists of three curves that all start at one point,…
In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…
The present paper starts with an introduction to quaternions and then defines the 3-dimmensional sphere as the set of quaternions of length one. The quaternion group induces on $\mathbb{S}^3$ a structure of noncommutative Lie group. This…
Small covers arising from 3-dimensional simple polytopes are an interesting class of 3-manifolds. The fundamental group is a rigid invariant for wide classes of 3-manifolds, particularly for orientable Haken manifolds, which include…
In this paper we study some geometric properties of surfaces in the Heisenberg group, $\mathcal{H}_{3}.$ We obtain, using the Gauss map for Lie groups, a partial classification of minimal graphs in $\mathcal{H}_{3}.$ We also proof the non…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
Following Riemann's idea, we prove the existence of a minimal disk in Euclidean space bounded by three lines in generic position and with three helicoidal ends of angles less than $\pi$. In the case of general angles, we prove that there…
In the Heisenberg group $\mathbb{H}^1$, equipped with a left-invariant and not necessarily symmetric norm in the horizontal distribution, we provide examples of entire area-minimizing horizontal graphs which are locally Lipschitz in…
In this note, we show that sub-Riemannian manifolds can contain branching normal minimizing geodesics. This phenomenon occurs if and only if a normal geodesic has a discontinuity in its rank at a non-zero time, which in particular for a…
The heterogeneous structure implies that a very few nodes may play the critical role in maintaining structural and functional properties of a large-scale network. Identifying these vital nodes is one of the most important tasks in network…
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the…
In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…
We study the network dismantling problem, which consists in determining a minimal set of vertices whose removal leaves the network broken into connected components of sub-extensive size. For a large class of random graphs, this problem is…