English
Related papers

Related papers: Sharp Lipschitz constants for the distance ratio m…

200 papers

In this paper we give a thorough study of Lipschitz spaces. We obtain the following new results: (1) Sharp Jawerth-Franke-type embeddings between the Besov and Lipschitz spaces extending the classical results for Besov and Sobolev spaces;…

Functional Analysis · Mathematics 2019-11-20 Oscar Domínguez , Dorothee D. Haroske , Sergey Tikhonov

We study the problem of extending an order-preserving real-valued Lipschitz map defined on a subset of a partially ordered metric space without increasing its Lipschitz constant and preserving its monotonicity. We show that a certain type…

Functional Analysis · Mathematics 2023-05-02 Efe A. Ok

We study space-like self-shrinkers of dimension $n$ in pseudo-Euclidean space $\ir{m+n}_m$with index $m$. We derive drift Laplacian of the basic geometric quantities and obtain their volume estimates in pseudo-distance function. Finally, we…

Differential Geometry · Mathematics 2013-07-02 Huaqiao Liu , Y. L. Xin

We prove a generalization for some $\mathbb C$ domains of Gehring - Palka theorem on Moebius transformations regarding the distance ratio metric. Namely, we show that this theorem is valid for arbitrary holomorphic mappings $f : H \to H$ or…

Complex Variables · Mathematics 2014-02-03 Slavko Simic

We obtain new characterizations for Bergman spaces with standard weights in terms of Lipschitz type conditions in the Euclidean, hyperbolic, and pseudo-hyperbolic metrics. As a consequence, we prove optimal embedding theorems when an…

Complex Variables · Mathematics 2007-05-23 Hasi Wulan , Kehe Zhu

We study "distance spheres": the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is "too dense" and a set of small volume, we can decompose $[0,1]^d$…

Classical Analysis and ODEs · Mathematics 2021-07-21 Guy C. David , McKenna Kaczanowski , Dallas Pinkerton

We prove a Lipschitz extension lemma in which the extension procedure simultaneously preserves the Lipschitz continuity for two non-equivalent distances. The two distances under consideration are the Euclidean distance and, roughly…

Analysis of PDEs · Mathematics 2021-01-27 Laura Caravenna , Gianluca Crippa

The basic input for many real objects is a finite cloud of unordered points. The strongest equivalence between objects in practice is rigid motion in a Euclidean space. A recent polynomial-time classification of point clouds required a…

Metric Geometry · Mathematics 2026-04-07 Olga Anosova , Vitaliy Kurlin

A finite set of unlabelled points in Euclidean space is the simplest representation of many real objects from mineral rocks to sculptures. Since most solid objects are rigid, their natural equivalence is rigid motion or isometry maintaining…

Metric Geometry · Mathematics 2023-03-27 Vitaliy Kurlin

We give a simple procedure to estimate the smallest Lipshitz constant of a degree 1 map from a Riemannian 2-sphere to the unit 2-sphere, up to a factor of 10. Using this procedure, we are able to prove several inequalities involving this…

Differential Geometry · Mathematics 2007-05-23 Larry Guth

We determine the local geometric structure of two-dimensional metric spaces with curvature bounded above as the union of finitely many properly embedded/branched immersed Lipschitz disks. As a result, we obtain a graph structure of the…

Metric Geometry · Mathematics 2024-12-04 Koichi Nagano , Takashi Shioya , Takao Yamaguchi

We consider an inverse variational problem for the lines of constant curvature in (pseudo-)Euclidean two-, three-, and four-dimensional spaces. The accumulated results are physically meaningful in the case of relativistic mechanics of…

Classical Analysis and ODEs · Mathematics 2022-02-17 R. Ya. Matsyuk

We extend some known results from smooth dynamical systems to the category of Lipschitz homeomorphisms of compact metric spaces. We consider dynamical properties as robust expansiveness and structural stability allowing Lipschitz…

Dynamical Systems · Mathematics 2014-09-26 Alfonso Artigue

Over the past few years, symmetric positive definite (SPD) matrices have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the…

Computer Vision and Pattern Recognition · Computer Science 2015-01-13 Raviteja Vemulapalli , David W. Jacobs

We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}\mu\{f-\E_{\mu} f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$ is the class of the integrable, Lipschitz functions on…

Probability · Mathematics 2013-12-09 Dainius Dzindzalieta

Following Weaver we study generalized differential operators, called (metric) derivations, and their linear algebraic properties. In particular, for k = 1, 2 we show that measures on k-dimensional Euclidean space that induce rank-k modules…

Metric Geometry · Mathematics 2011-10-20 Jasun Gong

For any metric space $X$, finite subset spaces of $X$ provide a sequence of isometric embeddings $X=X(1)\subset X(2)\subset\cdots$. The existence of Lipschitz retractions $r_n\colon X(n)\to X(n-1)$ depends on the geometry of $X$ in a subtle…

Metric Geometry · Mathematics 2021-08-10 Earnest Akofor , Leonid V. Kovalev

Let $G \subsetneq \mathbb{R}^n$ be a domain and let $d_1$ and $d_2$ be two metrics on $G$. We compare the geometries defined by the two metrics to each other for several pairs of metrics. The metrics we study include the distance ratio…

Metric Geometry · Mathematics 2018-01-29 Parisa Hariri , Matti Vuorinen , Xiaohui Zhang

This chapter reviews some past and recent developments in shape comparison and analysis of curves based on the computation of intrinsic Riemannian metrics on the space of curves modulo shape-preserving transformations. We summarize the…

Differential Geometry · Mathematics 2020-10-22 Martin Bauer , Nicolas Charon , Eric Klassen , Alice Le Brigant

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…

Data Structures and Algorithms · Computer Science 2025-05-19 Ainesh Bakshi , Vincent Cohen-Addad , Samuel B. Hopkins , Rajesh Jayaram , Silvio Lattanzi