English
Related papers

Related papers: On the oscillation rigidity of a Lipschitz functio…

200 papers

The metric dimension reduction modulus $k^\alpha_n(\ell_\infty)$ is the smallest $k$ such that every $n$--point metric space can be embedded into some $k$-dimensional normed space, with bi--Lipschitz distortion at most $\alpha$. Determining…

Metric Geometry · Mathematics 2025-08-12 Dylan J. Altschuler , Konstantin Tikhomirov

Let $T$ be a compact, metrisable and strongly countable-dimensional topological space. Let $\mathcal{M}^T$ be the set of all metrics $d$ on $T$ compatible with its topology, and equip $\mathcal{M}^T$ with the topology of uniform…

Functional Analysis · Mathematics 2024-05-31 Filip Talimdjioski

We show that for any $n$-dimensional lattice $\mathcal{L} \subseteq \mathbb{R}^n$, the torus $\mathbb{R}^n/\mathcal{L}$ can be embedded into Hilbert space with $O(\sqrt{n\log n})$ distortion. This improves the previously best known upper…

Metric Geometry · Mathematics 2020-05-04 Ishan Agarwal , Oded Regev , Yi Tang

We provide some necessary and sufficient conditions for a proper lower semicontinuous convex function, defined on a real Banach space, to be locally or globally Lipschitz continuous. Our criteria rely on the existence of a bounded selection…

Functional Analysis · Mathematics 2019-11-13 Bao Tran Nguyen , Pham Duy Khanh

We prove necessary and sufficient conditions for the weak-$L^p$ boundedness, for $p \in (1,\infty)$, of a maximal operator on the infinite-dimensional torus. In the endpoint case $p=1$ we obtain the same weak-type inequality enjoyed by the…

Classical Analysis and ODEs · Mathematics 2023-03-07 Dariusz Kosz , Guillermo Rey , Luz Roncal

It was conjectured that if $f\in C^1(\mathbb{R}^n,\mathbb{R}^n)$ satisfies $\operatorname{rank} Df\leq m<n$ everywhere in $\mathbb{R}^n$, then $f$ can be uniformly approximated by $C^\infty$-mappings $g$ satisfying $\operatorname{rank}…

Metric Geometry · Mathematics 2023-02-07 Paweł Goldstein , Piotr Hajłasz

In this note, we consider the complexity of optimizing a highly smooth (Lipschitz $k$-th order derivative) and strongly convex function, via calls to a $k$-th order oracle which returns the value and first $k$ derivatives of the function at…

Optimization and Control · Mathematics 2021-04-29 Guy Kornowski , Ohad Shamir

We prove that for every $n\in \mathbb{N}$ there exists a metric space $(X,d_X)$, an $n$-point subset $S\subseteq X$, a Banach space $(Z,\|\cdot\|_Z)$ and a $1$-Lipschitz function $f:S\to Z$ such that the Lipschitz constant of every function…

Metric Geometry · Mathematics 2015-06-16 Assaf Naor , Yuval Rabani

In the first part of this paper we establish, in terms of so called k-tangential sets, a kind of optimal estimate for the size and structure of the set of non-differentiability of Lipshitz functions with one-sided directional derivatives.…

Classical Analysis and ODEs · Mathematics 2013-05-13 Hannes Luiro

Given a monotone convex function on the space of essentially bounded random variables with the Lebesgue property (order continuity), we consider its extension preserving the Lebesgue property to as big solid vector space of random variables…

Functional Analysis · Mathematics 2014-02-20 Keita Owari

We study the problem of maximizing a non-negative monotone $k$-submodular function $f$ under a knapsack constraint, where a $k$-submodular function is a natural generalization of a submodular function to $k$ dimensions. We present a…

Data Structures and Algorithms · Computer Science 2023-08-04 Zhongzheng Tang , Chenhao Wang , Hau Chan

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Metric Geometry · Mathematics 2017-07-07 Julian Grote , Elisabeth M. Werner

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

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…

Data Structures and Algorithms · Computer Science 2024-11-19 Thibaut Horel , Yaron Singer

Let $\mathcal{M}_{0}^n$ be the class of closed, simply-connected, non-negatively curved Riemannian manifolds admitting an isometric, effective, isotropy-maximal torus action. We prove that if $M\in \mathcal{M}_{0}^n$, then $M$ is…

Differential Geometry · Mathematics 2020-11-26 Christine Escher , Catherine Searle

We consider the question of when the Laplace eigenfunctions on an arbitrary flat torus $\mathbf{T}_\Gamma:=\mathbf{R}^d/\Gamma$ are flexible enough to approximate, over the natural length scale of order $1/\sqrt\lambda$, where $\lambda\gg1$…

Spectral Theory · Mathematics 2021-11-15 Alberto Enciso , Alba García-Ruiz , Daniel Peralta-Salas

It is hereby established that the set of Lipschitz functions $f:\mathcal{U}\rightarrow \mathbb{R}$ ($\mathcal{U}$ nonempty open subset of $\ell_{d}^{1}$) with maximal Clarke subdifferential contains a linear subspace of uncountable…

Functional Analysis · Mathematics 2023-05-22 Aris Daniilidis , Gonzalo Flores

The paper aims at finding widely and smoothly defined nonparametric location and scatter functionals. As a convenient vehicle, maximum likelihood estimation of the location vector m and scatter matrix S of an elliptically symmetric t…

Statistics Theory · Mathematics 2009-03-20 R. M. Dudley , Sergiy Sidenko , Zuoqin Wang

Lipschitz constants for the width and diameter functions of a convex body in $\mathbb R^n$ are found in terms of its diameter and thickness (maximum and minimum of both functions). Also, a dual approach to thickness is proposed.

Metric Geometry · Mathematics 2026-02-17 Oleg Mushkarov , Nikolai Nikolov , Pascal J. Thomas

Tarski's theorem states that every monotone function from a complete lattice to itself has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid of side length $n$ under the $\leq$…

Computational Complexity · Computer Science 2025-07-15 Simina Brânzei , Reed Phillips , Nicholas Recker