Related papers: Minimal networks on S^2
Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean…
Let B be a centrally symmetric convex polygon of R^2 and || p - q || be the distance between two points p,q in R^2 in the normed plane whose unit ball is B. For a set T of n points (terminals) in R^2, a B-Manhattan network on T is a network…
We prove that any manifold diffeomorphic to $S^3$ and endowed with a generic metric contains at least two embedded minimal two-spheres. The existence of at least one minimal two-sphere was obtained by Simon-Smith in 1983. Our approach…
Quantification of symmetries in complex networks is typically done globally in terms of automorphisms. Extending previous methods to locally assess the symmetry of nodes is not straightforward. Here we present a new framework to quantify…
Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in a Euclidean space.…
Given a n points in two dimensional space, a Manhattan Network G is a network that connects all n points with either horizontal or vertical edges, with the property that for any two point in G should be connected by a Manhattan path and…
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…
The notion of basic net (called also basic polyhedron) on $S^2$ plays a central role in Conway's approach to enumeration of knots and links in $S^3$. Drobotukhina applied this approach for links in $RP^3$ using basic nets on $RP^2$. By a…
The loss surface of deep neural networks has recently attracted interest in the optimization and machine learning communities as a prime example of high-dimensional non-convex problem. Some insights were recently gained using spin glass…
A behavior of extreme networks under deformations of their boundary sets is investigated. It is shown that analyticity of a deformation of boundary set guarantees preservation of the networks types for minimal spanning trees, minimal…
We study minimal surfaces in generic sub-Riemannian manifolds with sub-Riemannian structures of co-rank one. These surfaces can be defined as the critical points of the so-called {\it horizontal} area functional associated to the canonical…
We consider planar networks of three curves that meet at two junctions with prescribed equal angles, minimizing a combination of the elastic energy and the length functional. We prove existence and regularity of minimizers, and we show some…
This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and an iterative method for doing so in 3D space. Such a network will be…
We prove that the Gauss curvature and the curvature of the normal connection of any minimal surface in the four dimensional Euclidean space satisfy an inequality, which generates two classes of minimal surfaces: minimal surfaces of general…
We study shortest curves in proximally smooth subsets of a Hilbert space. We consider an $R$-proximally smooth set $A$ in a Hilbert space with points $a$ and $b$ satisfying $\left|{a-b}\right| < 2R.$ We provide a simple geometric algorithm…
In this work, we study plane and spherical curves in Euclidean and Lorentz-Minkowski 3-spaces by employing rotation minimizing (RM) frames. By conveniently writing the curvature and torsion for a curve on a sphere, we show how to find the…
Neural network minima are often connected by curves along which train and test loss remain nearly constant, a phenomenon known as mode connectivity. While this property has enabled applications such as model merging and fine-tuning, its…
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…
We construct a parabolic entire minimal graph $S$ over a finite topology complete Riemannian surface $\Sigma$ of curvature $-1$ and infinite area (thus of non-parabolic conformal type). The vertical projection of this graph yields a…
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…