Related papers: Minimal networks on balls and spheres for almost s…

The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean…

This work investigates minimal parametric networks in hyperspaces of closed subsets of metric spaces endowed with the Hausdorff distance. It is shown that the problems of finding such networks are nontrivial only within finiteness classes,…

In this article we investigate the question of finding a network configuration of minimal length connecting three given points in the Heisenberg group. After proving existence of (possibly degenerate) minimal horizontal triods, we…

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 survey the classification of the Riemannian metrics on spheres with respect to which all equators are minimal hypersurfaces, and discuss problems related to these geometries.

Suppose that under the action of gravity, liquid drains through the unit $d$-cube via a minimal-length network of channels constrained to pass through random sites and to flow with nonnegative component in one of the canonical orthogonal…

We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…

We prove upper and lower bounds on the minimal spherical dispersion, improving upon previous estimates obtained by Rote and Tichy [Spherical dispersion with an application to polygonal approximation of curves, Anz. \"Osterreich. Akad. Wiss.…

What one obtains when the min-max methods for the distance function are applied on the space of pairs of points of a Riemannian two-sphere? This question is studied in details in the present article. We show that the associated min-max…

For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1, d - 1}(\epsilon)$ denote the sphere product $S^{1} \times S^{d - 1}$ if $\epsilon = 0$ and the twisted $S^{d - 1}$ bundle over $S^{1}$ if $\epsilon = 1$. The main results of this…

We define a new measure of network symmetry that is capable of capturing approximate global symmetries of networks. We apply this measure to different networks sampled from several classic network models, as well as several real-world…

This note contains two types of small ball estimates for random vectors in finite dimensional spaces equipped with a quasi-norm. In the first part, we obtain bounds for the small ball probability of random vectors under some smoothness…

We prove a saturation theorem for linearized shallow ReLU$^k$ neural networks on the unit sphere $\mathbb S^d$. For any antipodally quasi-uniform set of centers, if the target function has smoothness $r>\tfrac{d+2k+1}{2}$, then the best…

Following a review of related results in rigidity theory, we provide a construction to obtain generically universally rigid frameworks with the minimum number of edges, for any given set of n nodes in two or three dimensions. When a set of…

Using the Lawson's existence theorem of minimal surfaces and the symmetries of the Hopf fibration, we will construct symmetric embedded closed minimal surfaces in the three dimensional sphere. These surfaces contain the Clifford torus, the…

Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…

The minimal number of nodes required to multilaterate a network endowed with geodesic distance (i.e., to uniquely identify all nodes based on shortest path distances to the selected nodes) is called its metric dimension. This quantity is…

In the current paper we present a new proof of the small ball inequality in two dimensions. More importantly, this new argument, based on an approach inspired by lacunary Fourier series, reveals the first formal connection between this…

We construct isospectral pairs of Riemannian metrics on S^5 and on B^6, thus lowering by three the dimension of spheres and balls on which such metrics have been constructed previously (S^{n\ge 8} and B^{n\ge 9}). We also construct…

A network is said to have the properties of a small world if a suitably defined average distance between any two nodes is proportional to the logarithm of the number of nodes, $N$. In this paper, we present a novel derivation of the…