English
Related papers

Related papers: Extending Bilipschitz Mappings between Separated N…

200 papers

We estimate the second order linking invariants of Lipschitz maps from an n-dimensional ellipse. The estimate uses a new directionally-dependent version of the isoperimetric inequality for cycles inside the ellipse. Using this work, we…

Differential Geometry · Mathematics 2008-02-26 Larry Guth

A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…

Optimization and Control · Mathematics 2019-04-08 Valentin R. Koch , Hung M. Phan

For complete metric spaces $X$ and $Y$, a description of linear biseparating maps between spaces of vector-valued Lipschitz functions defined on $X$ and $Y$ is provided. In particular it is proved that $X$ and $Y$ are bi-Lipschitz…

Functional Analysis · Mathematics 2008-07-25 Jesus Araujo , Luis Dubarbie

Many real networks are embedded in space, where in some of them the links length decay as a power law distribution with distance. Indications that such systems can be characterized by the concept of dimension were found recently. Here, we…

Physics and Society · Physics 2015-06-05 Thorsten Emmerich , Armin Bunde , Shlomo Havlin , Li Guanlian , Li Daqing

Euclidean embeddings of data are fundamentally limited in their ability to capture latent semantic structures, which need not conform to Euclidean spatial assumptions. Here we consider an alternative, which embeds data as discrete…

Machine Learning · Computer Science 2019-05-10 Charlie Frogner , Farzaneh Mirzazadeh , Justin Solomon

The geometric bottleneck Steiner network problem on a set of vertices $X$ embedded in a normed plane requires one to construct a graph $G$ spanning $X$ and a variable set of $k\geq 0$ additional points, such that the length of the longest…

Combinatorics · Mathematics 2013-01-22 M. Brazil , C. J. Ras , D. A. Thomas

We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its ``sufficiently large''…

Optimization and Control · Mathematics 2024-01-26 Nikita Puchkin , Vladimir Spokoiny , Eugene Stepanov , Dario Trevisan

The problem of extending a function $f$ defined on a training data $\mathcal{C}$ on an unknown manifold $\mathbb{X}$ to the entire manifold and a tubular neighborhood of this manifold is considered in this paper. For $\mathbb{X}$ embedded…

Machine Learning · Computer Science 2016-07-26 Charles K. Chui , H. N. Mhaskar

We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…

Differential Geometry · Mathematics 2008-11-26 Thomas Branson , Andreas Cap , Michael Eastwood , Rod Gover

This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…

Classical Analysis and ODEs · Mathematics 2021-03-29 Moritz Egert

There are several notions of duality between lines and points. In this note, it is shown that all these can be studied in a unified way. Most interesting properties are independent of specific choices. It is also shown that either dual…

Computational Geometry · Computer Science 2025-08-22 Sanjeev Saxena

In this paper, we extend the information theoretic framework that was developed in earlier work to multi-hop network settings. For a given network, we construct a novel deterministic model that quantifies the ability of the network in…

Information Theory · Computer Science 2015-08-21 Shao-Lun Huang , Changho Suh , Lizhong Zheng

We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…

Social and Information Networks · Computer Science 2025-09-11 Francesco Zigliotto , Desmond J. Higham

A central challenge in dynamic network analysis is to represent temporal evolution in a way that is both geometrically meaningful and statistically identifiable. One approach embeds a sequence of network snapshots as trajectories in a…

Machine Learning · Statistics 2026-05-12 Haruka Ezoe , Ryohei Hisano

We prove that every bi-Lipschitz embedding of the unit circle into the plane can be extended to a bi-Lipschitz map of the unit disk with linear bounds on the constants involved. This answers a question raised by Daneri and Pratelli.…

Complex Variables · Mathematics 2020-03-24 Leonid V. Kovalev

Many sub-Riemannian manifolds like the Heisenberg group do not admit bi- Lipschitz embedding into any Euclidean space. In contrast, the Grushin plane admits a bi-Lipschitz embedding into some Euclidean space. This is done by extending a…

Metric Geometry · Mathematics 2010-11-02 Jeehyeon Seo

Biharmonic and conformal-biharmonic maps are two fourth-order generalizations of the well-studied notion of harmonic maps in Riemannian geometry. In this article we consider maps into the Euclidean sphere and investigate a geometric…

Differential Geometry · Mathematics 2026-03-09 Volker Branding

This is a survey on recent developments on the Hausdorff dimension of projections and intersections for general subsets of Euclidean spaces, with an emphasis on estimates of the Hausdorff dimension of exceptional sets and on restricted…

Classical Analysis and ODEs · Mathematics 2018-01-03 Pertti Mattila

Learning representations on Grassmann manifolds is popular in quite a few visual recognition tasks. In order to enable deep learning on Grassmann manifolds, this paper proposes a deep network architecture by generalizing the Euclidean…

Computer Vision and Pattern Recognition · Computer Science 2018-01-30 Zhiwu Huang , Jiqing Wu , Luc Van Gool

This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…

Combinatorics · Mathematics 2007-05-23 J. H. Conway , R. H. Hardin , N. J. A. Sloane
‹ Prev 1 3 4 5 6 7 10 Next ›