Related papers: Extending Bilipschitz Mappings between Separated N…
We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…
We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize its continuous diameter, i.e., the largest network distance between any two points on the augmented network. Unlike in the discrete setting where a…
Positive bi-linear maps between matrix algebras play important roles to detect tri-partite entanglement by the duality between bi-linear maps and tri-tensor products. We exhibit indecomposable positive bi-linear maps between $2\times 2$…
We propose a method for learning and sampling from probability distributions supported on the simplex. Our approach maps the open simplex to Euclidean space via smooth bijections, leveraging the Aitchison geometry to define the mappings,…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
We derive a formally simple approximate analytical solution to the Poisson-Boltzmann equation for the spherical system via a geometric mapping. Its regime of applicability in the parameter space of the spherical radius and the surface…
On the space of probability densities, we extend the Wasserstein geodesics to the case of higher-order interpolation such as cubic spline interpolation. After presenting the natural extension of cubic splines to the Wasserstein space, we…
We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…
Shapes of four dimensional spaces can be studied effectively via maps to standard surfaces. We explain, and illustrate by quintessential examples, how to simplify such generic maps on 4-manifolds topologically, in order to derive simple…
A separated net is a set of points which is relatively dense and uniformly discrete (another name for a Delone set). We are dealing with tilings and separated nets in Euclidean spaces and with the question whether a given separated net is…
The question of extension of locally defined maps to the entire space arises in many problems of analysis (e.g., local linearization of functional equations). A known classical method of extension of smooth local maps on Banach spaces uses…
This note is a continuation of the author's previous work on "Sharp bounds for the max-sliced Wasserstein distance." We use the same technique to obtain an upper bound for the expected max-sliced 2-Wasserstein distance between a compactly…
We solve the Dirichlet problem for fully nonlinear elliptic equations on Riemannian manifolds under essentially optimal structure conditions, especially with no restrictions to the curvature of the underlying manifold and the second…
Metric embeddings are a widely used method in algorithm design, where generally a ``complex'' metric is embedded into a simpler, lower-dimensional one. Historically, the theoretical computer science community has focused on bi-Lipschitz…
Brehm's extension theorem states that a non-expansive map on a finite subset of a Euclidean space can be extended to a piecewise-linear map on the entire space. In this note, it is verified that the proof of the theorem is constructive…
We review the special geometry of N = 2 supersymmetric vector and hypermultiplets with emphasis on recent developments and applications. A new formulation of the local c-map based on the Hesse potential and special real coordinates is…
Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways (cf. [Lub94], [HLW06], [Lub12] and the…
It is shown that the expansion methods developed in refs. arXiv:hep-th/0212347 and arXiv:hep-th/0401033v2 can be generalized so that they permit to study the expansion of algebras of loops, both when the compact finite-dimensional algebra…
We prove solvability theorems for relaxed one-sided Lipschitz multivalued mappings in Hilbert spaces and for composed mappings in the Gelfand triple setting. From these theorems, we deduce properties of the inverses of such mappings and…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…