English
Related papers

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

200 papers

We study surfaces with a constant ratio of principal curvatures in Euclidean and simply isotropic geometries and characterize rotational, channel, ruled, helical, and translational surfaces of this kind under some technical restrictions…

Differential Geometry · Mathematics 2025-10-17 Khusrav Yorov , Mikhail Skopenkov , Helmut Pottmann

In 2002 F. Wirth has proved that the joint spectral radius of irreducible compact sets of matrices is locally Lipschitz continuous as a function of the matrix set. In the paper, an explicit formula for the related Lipschitz constant is…

Rings and Algebras · Mathematics 2010-04-20 Victor Kozyakin

We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and…

Machine Learning · Computer Science 2025-08-28 R. Arnau , A. González Cortés , E. A. Sánchez Pérez , S. Sanjuan

We prove the equivalence of two seemingly very different ways of generalising Rademacher's theorem to metric measure spaces. One such generalisation is based upon the notion of forming partial derivatives along a very rich structure of…

Metric Geometry · Mathematics 2015-12-02 David Bate

We consider a class of piecewise hyperbolic maps from the unit square to itself preserving a contracting foliation and inducing a piecewise expanding quotient map, with infinite derivative (like the first return maps of Lorenz like flows).…

Dynamical Systems · Mathematics 2017-10-05 Stefano Galatolo , Isaia Nisoli

We discover new monotonicity formulae for minimal submanifolds in space forms, which imply the sharp area bound for minimal submanifolds through a prescribed point in a geodesic ball. These monotonicity formulae involve an energy-like…

Differential Geometry · Mathematics 2022-10-10 Keaton Naff , Jonathan J. Zhu

Data-sensitive metrics adapt distances locally based the density of data points with the goal of aligning distances and some notion of similarity. In this paper, we give the first exact algorithm for computing a data-sensitive metric called…

Computational Geometry · Computer Science 2020-04-22 Timothy Chu , Gary Miller , Donald Sheehy

We provide an implementation to compute the flat metric in any dimension. The flat metric, also called dual bounded Lipschitz distance, generalizes the well-known Wasserstein distance $W_1$ to the case that the distributions are of unequal…

Machine Learning · Computer Science 2025-06-17 Henri Schmidt , Christian Düll

Sharp bounds are obtained, under a variety of assumptions on the eigenvalues of the Einstein tensor, for the ratio of the Hawking mass to the areal radius in static, spherically symmetric space-times.

General Relativity and Quantum Cosmology · Physics 2008-11-26 Paschalis Karageorgis , John G. Stalker

We introduce a generalized version of the local Lipschitz number $\textrm{lip}\,u$, and show that it can be used to characterize Sobolev functions $u\in W_{\textrm{loc}}^{1,p}(\mathbb R^n)$, $1\le p\le \infty$, as well as functions of…

Metric Geometry · Mathematics 2024-06-12 Panu Lahti

We investigate the first-order differential calculus over extended metric-topological measure spaces. The latter are quartets $\mathbb X=(X,\tau,{\sf d},\mathfrak m)$, given by an extended metric space $(X,{\sf d})$ together with a weaker…

Functional Analysis · Mathematics 2025-03-05 Enrico Pasqualetto , Janne Taipalus

We continue our study, initiated in our earlier paper, of Riemann surfaces with constant curvature and isolated conic singularities. Using the machinery developed in that earlier paper of extended configuration families of simple divisors,…

Differential Geometry · Mathematics 2021-06-04 Rafe Mazzeo , Xuwen Zhu

We show that every real-valued Lipschitz function on a subset of a metric space can be extended to the whole space while preserving the slope and, up to a small error, the global Lipschitz constant. This answers a question posed by Di…

Metric Geometry · Mathematics 2025-07-29 Nicolò De Ponti , Jacopo Somaglia

We give a sharp condition on the lower local Lipschitz constant of a mapping from a metric space supporting a Poincar\'e inequality to a Banach space with the Radon-Nikodym property that guarantees differentiability at almost every point.…

Metric Geometry · Mathematics 2013-05-31 Kevin Wildrick , Thomas Zürcher

For a metric space $X$, we study the space $D^{\infty}(X)$ of bounded functions on $X$ whose infinitesimal Lipschitz constant is uniformly bounded. $D^{\infty}(X)$ is compared with the space $\LIP^{\infty}(X)$ of bounded Lipschitz functions…

Metric Geometry · Mathematics 2009-01-22 E. Durand , J. A. Jaramillo

The current status concerning Hardy-type inequalities with sharp constants is presented and described in a unified convexity way. In particular, it is then natural to replace the Lebesgue measure $dx$ with the Haar measure $dx/x.$ There are…

Classical Analysis and ODEs · Mathematics 2023-02-27 Lars-Erik Persson , Natasha Samko , George Tephnadze

We prove stability results associated with upper bounds for the first eigenvalue of certain second order differential operators of divergence-type on hypersurfaces of the Euclidean space. We deduce some applications to $r$-stability as well…

Differential Geometry · Mathematics 2017-06-27 Julien Roth , Julian Scheuer

In this paper we give pinching theorems for the first nonzero eigenvalue of the Laplacian on the compact hypersurfaces of ambient spaces with bounded sectional curvature. As application we deduce rigidity results for stable constant mean…

Differential Geometry · Mathematics 2017-02-22 Jean-Francois Grosjean , Julien Roth

The Gromov--Hausdorff distance measures the difference in shape between compact metric spaces. While even approximating the distance up to any practical factor poses an NP-hard problem, its relaxations have proven useful for the problems in…

Metric Geometry · Mathematics 2022-09-12 Vladyslav Oles , Kevin R. Vixie

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson