Related papers: Minimal horizontal triods: Analysis and computatio…
We adapt the problem of continuous congested optimal transport to the Heisenberg group, equipped with a sub-Riemannian metric. Originally introduced in the Euclidean setting by Carlier, Jimenez, and Santambrogio as a path-dependent variant…
Given a set of $n$ points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum of Euclidean length of its edges. This incredibly challenging problem has been studied for more than…
We construct most symmetric Saddle towers in Heisenberg space i.e. periodic minimal surfaces that can be seen as the desingularization of vertical planes intersecting equiangularly. The key point is the construction of a suitable barrier to…
We explicitly find the minima as well as the minimum points of the geodesic length functions for the family of filling (hence non-simple) closed curves, $a^2b^n$ ($n\ge 3$), on a complete one-holed hyperbolic torus in its relative…
The concept of minimal length, inspired by Heisenberg algebra, is applied to the geometrical collective Bohr- Mottelson model (BMM) of nuclei. With the deformed canonical commutation relation and the Pauli-Podolsky prescription, we have…
In the present paper we consider generic Sub-Riemannian structures on the co-rank 1 non-holonomic vector distributions and introduce the associated canonical volume and ''horizontal'' area forms. As in the classical case, the Sub-Riemannian…
We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between…
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…
We study the quenching of the Haldane gap in quasi-one-dimensional systems of weakly coupled spin-1 antiferromagnetic Heisenberg chains. The critical interchain coupling Jc required to stabilize long range magnetic order can be accurately…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
This work is part of the field of the hypergraph theory and focuses on hypergraph minimal transversal. The problem of extracting the minimal transversals from a hypergraph received the interest of many researchers as shown the number of…
We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering applications. In this paper we present an algorithm to compute a set of…
The observation, design and analysis of mesh-like networks in bionics, polymer physics and biological systems has brought forward an extensive catalog of fascinating structures of which a subgroup share a particular, yet critically under…
We address a conjecture that $\pi_1$-surjective maps between closed aspherical 3-manifolds having the same rank on $\pi_1$ must be of non-zero degree. The conjecture is proved for Seifert manifolds, which is used in constructing the first…
We provide a long-time existence and sub-convergence result for the elastic flow of a three network in $\mathbb{R}^{n}$ under some mild topological assumptions. The evolution is such that the sum of the elastic energies of the three curves…
Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a…
In this paper, we introduce super-minimally $k$-connected graphs, those $k$-connected graphs in which no proper subgraph is $k$-connected. For $k$ greater than or equal to three, this class lies strictly between the classes of minimally…
A hypergraph $H$ is hamiltonian-connected if for any distinct vertices $x$ and $y$, $H$ contains a hamiltonian Berge path from $x$ to $y$. We find for all $3\leq r<n$, exact lower bounds on minimum degree $\delta(n,r)$ of an $n$-vertex…
One of the defining features of complex networks is the connectivity properties that we observe emerging from local interactions. Recently, hypergraphs have emerged as a versatile tool to model networks with non-dyadic, higher-order…