Related papers: Minimal distance transformations between links and…
Proteins naturally occur in crowded cellular environments and interact with other proteins, nucleic acids, and organelles. Since most previous experimental protein structure determination techniques require that proteins occur in idealized,…
We initiate the study of metric embeddings with \emph{outliers}. Given some metric space $(X,\rho)$ we wish to find a small set of outlier points $K \subset X$ and either an isometric or a low-distortion embedding of $(X\setminus K,\rho)$…
In dissipative ordinary differential equation systems different time scales cause anisotropic phase volume contraction along solution trajectories. Model reduction methods exploit this for simplifying chemical kinetics via a time scale…
The determination of the coil-globule transition of a polymer is generally based on the reconstruction of scaling laws, implying the need for samples from a rather wide range of different polymer lengths $N$. The spectral point of view…
The stretchability of polymeric materials is critical to many applications such as stretchable electronics and soft robotics, yet the stretchability of conventional cross-linked linear polymers is limited by the entanglements between…
We consider the minimum distance projection in the $L_2$-norm from an arbitrary point in an $n$-dimensional, Euclidian space onto the canonical simplex. It is shown that this problem reduces to a univariate problem that can be solved by a…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
Recent literature has shown that symbolic data, such as text and graphs, is often better represented by points on a curved manifold, rather than in Euclidean space. However, geometrical operations on manifolds are generally more complicated…
The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…
Polymer translocation in three dimensions out of planar confinements is studied in this paper. Three membranes are located at $z=-h$, $z=0$ and $z=h_1$. These membranes are impenetrable, except for the middle one at $z=0$, which has a…
If many micelles adsorb onto the same polymer molecule then they are said to form a necklace. A minimal model of such a necklace is proposed and shown to be almost equivalent to a 1-dimensional fluid with nearest-neighbour interactions. The…
The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…
We find the equations that allow us to compute the position of the two interior nodes (weighted Fermat-Torricelli points) w.r. to the weighted Steiner problem for four points determining a tetrahedron in R^3. Furthermore, by applying the…
In this work, we study theoretical models of \emph{programmable matter} systems. The systems under consideration consist of spherical modules, kept together by magnetic forces and able to perform two minimal mechanical operations (or…
We establish that many fundamental concepts and techniques in quantum field theory and collider physics can be naturally understood and unified through a simple new geometric language. The idea is to equip the space of collider events with…
Given a compact $E \subset \mathbb{R}^n$ and $s > 0$, the maximum distance problem seeks a compact and connected subset of $\mathbb{R}^n$ of smallest one dimensional Hausdorff measure whose $s$-neighborhood covers $E$. For $E\subset…
We study the problem of minimizing the Wasserstein distance between a probability distribution and an algebraic variety. We consider the setting of finite state spaces and describe the solution depending on the choice of the ground metric…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
While many Machine Learning methods were developed or transposed on Riemannian manifolds to tackle data with known non Euclidean geometry, Optimal Transport (OT) methods on such spaces have not received much attention. The main OT tool on…
In this work a field theoretical model is constructed to describe the statistical mechanics of an arbitrary number of topologically linked polymers in the context of the analytical approach of Edwards. As an application, the effects of the…