Related papers: Periodic Steiner networks minimizing length

In this work, I collect and discuss a series of open questions in one-dimensional geometric optimization in Euclidean spaces. The focus is on two classes of problems: maximal distance minimizers and Steiner trees. Maximal distance…

We get a continuous one-parameter new family of embedded minimal surfaces, of which the period problems are two-dimensional. Moreover, one proves that it has Scherk second surface and Hoffman-Wohlgemuth example as limit-members.

Let $M$ be a Riemannian $2$-sphere. A classical theorem of Lyusternik and Shnirelman asserts the existence of three distinct simple non-trivial periodic geodesics on $M$. In this paper we prove that there exist three simple periodic…

We find the first examples of triply periodic minimal surfaces of which the intrinsic symmetries are all of horizontal type.

This paper mathematically studies membranes and filaments adhering to periodic patterned substrates in a one-dimensional model. The problem is formulated by the minimizing problem of an elastic energy with a contact potential on graph…

In this paper, we study triply periodic surfaces with minimal surface area under a constraint in the volume fraction of the regions (phases) that the surface separates. Using a variational level set method formulation, we present a…

We study the minimal surface equation in the Heisenberg space, Nil_3. A geometric proof of non existence of minimal graphs over non convex, bounded and unbounded domains is achieved (our proof holds in the Euclidean space as well). We solve…

We study surfaces in Euclidean space ${\mathbb R}^3$ that are minimal for a log-linear density $\phi(x,y,z)=\alpha x+\beta y+\gamma y$, where $\alpha,\beta,\gamma$ are real numbers not all zero. We prove that if a surface is $\phi$-minimal…

The Wiener index of a graph is the sum of all the distances between any pair of vertices. We aim to describe graphs which minimize the Wiener index among all unicyclic graphs with fixed girth and given degree sequence. Depending on where…

Belk and Connelly introduced the realizable dimension $\textrm{rd}(G)$ of a finite graph $G$, which is the minimum nonnegative integer $d$ such that every framework $(G,p)$ in any dimension admits a framework in $\mathbb{R}^d$ with the same…

We study periodic tessellations of the Euclidean space with unequal cells arising from the minimization of perimeter functionals. Existence results and qualitative properties of minimizers are discussed for different classes of problems,…

We classify nonsingular symmetric periodic trajectories (SPTs) of billiards inside ellipsoids of R^{n+1} without any symmetry of revolution. SPTs are defined as periodic trajectories passing through some symmetry set. We prove that there…

This note provides a sufficient condition for linear lower bounds on chemical distances (compared to the Euclidean distance) in general spatial random graphs. The condition is based on the scarceness of long edges in the graph and weak…

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…

We show the first near-linear time randomized algorithms for listing all minimum vertex cuts of polylogarithmic size that separate the graph into at least three connected components (also known as shredders) and for finding the most…

We introduce a square tiling/tetragonal strip representation to the P, D, and G triply periodic minimal surfaces. This approach is useful in identifying mixtures and grain boundaries of these surfaces that might be useful for material…

In this paper, we introduce the graph $G(S)$ of a bounded semilattice $S$, which is a generalization of the intersection graph of the substructures of an algebraic structure. We prove some general theorems about these graphs; as an example,…

Finding shortest paths in a graph is relevant for numerous problems in computer vision and graphics, including image segmentation, shape matching, or the computation of geodesic distances on discrete surfaces. Traditionally, the concept of…

In this paper, we study how the distance spectral radius behaves when the graph is perturbed by grafting edges. As applications, we also determine the graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal distance…

Let $G$ be a connected graph and $\ell : E(G) \to \mathbb{R}^+$ a length-function on the edges of $G$. The Steiner distance $\mathrm{sd}_G(A)$ of $A \subseteq V(G)$ within $G$ is the minimum length of a connected subgraph of $G$ containing…