Related papers: Minimal elastic networks
We study the properties of sets $\Sigma$ which are the solutions of the maximal distance minimizer problem, i.e. of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…
In this paper we deal with the existence, regularity and Beltrami field property of magnetic energy minimisers under a helicity constraint. We in particular tackle the problem of characterising local as well as global minimisers of the…
In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is minimized. This paper studies an online (learning) variant of…
An important open problem in the synthesis of passive controllers is to obtain a passive network that realizes an arbitrary given impedance function and contains the least possible number of elements. This problem has its origins in…
Particles interacting through long-range attraction and short-range repulsion given by power-laws have been widely used to model physical and biological systems, and to predict or explain many of the patterns they display. Apart from rare…
We study the singular perturbation of an elastic energy with a singular weight. The minimization of this energy results in a multi-scale pattern formation. We derive an energy scaling law in terms of the perturbation parameter and prove…
The paper establishes the existence of homeomorphisms between two planar domains that minimize the Dirichlet energy. Specifically, among all homeomorphisms f : R -> R* between bounded doubly connected domains such that Mod (R) < Mod (R*)…
Linearized models of power systems are often desirable to formulate tractable control and optimization problems that still reflect real-world physics adequately under various operating conditions. In this paper, we propose an approach that…
For a given tree tensor network $G$, we call a tuple of bond dimensions minimal if there exists a tensor $T$ that can be represented by this network but not on the same tree topology with strictly smaller bond dimensions. We establish…
The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the…
We consider a thin elastic sheet with a finite number of disclinations in a variational framework in the F\"oppl-von K\'arm\'an approximation. Under the non-physical assumption that the out-of-plane displacement is a convex function, we…
We study knots in $\mathbb{S}^3$ obtained by the intersection of a minimal surface in $\mathbb{R}^4$ with a small 3-sphere centered at a branch point. We construct examples of new minimal knots. In particular we show the existence of…
The power graph of a group $G$ is the graph whose vertex set is $G$ and two distinct vertices are adjacent if one is a power of the other. In this paper, the minimum degree of power graphs of certain classes of cyclic groups, abelian…
We consider the topic of linearization of finite elasticity for pure traction problems. We characterize the variational limit for the approximating sequence of rescaled nonlinear elastic energies. We show that the limiting minimal value can…
For a given family of smooth closed curves $\gamma^1,...,\gamma^\alpha\subset\mathbb{R}^3$ we consider the problem of finding an elastic \emph{connected} compact surface $M$ with boundary $\gamma=\gamma^1\cup...\cup\gamma^\alpha$. This is…
We prove that the optimal way to enclose and separate four planar regions with equal area using the less possible perimeter requires all regions to be connected. Moreover, the topology of such optimal clusters is uniquely determined.
We describe the structure of the graphs with the smallest average distance and the largest average clustering given their order and size. There is usually a unique graph with the largest average clustering, which at the same time has the…
Many foraging microorganisms rely upon cellular transport networks to deliver nutrients, fluid and organelles between different parts of the organism. Networked organisms ranging from filamentous fungi to slime molds demonstrate a…
We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…
We consider energy-minimizing divergence-free eigenfields of the curl operator in dimension three from the perspective of contact topology. We give a negative answer to a question of Etnyre and the first author by constructing curl…