Related papers: Algorithmic aspects of Lipschitz functions

A result of Shen says that if $F\colon2^{\mathbb{N}}\rightarrow2^{\mathbb{N}}$ is an almost-everywhere computable, measure-preserving transformation, and $y\in2^{\mathbb{N}}$ is Martin-L\"of random, then there is a Martin-L\"of random…

A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a…

We show that on separable Banach spaces admitting a separating polynomial, any uniformly continuous, bounded, real-valued function can be uniformly approximated by Lipschitz, analytic maps on bounded sets.

We develop a systematic algorithmic framework that unites global and local classification problems using index sets. We prove that the classification problem for continuous (binary) regular functions among almost everywhere linear,…

Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object should be random with respect to image distribution if and only…

Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

The classical McShane-Whitney extension theorem for Lipschitz functions is refined by showing that for a closed subset of the domain, it remains valid for any interval of the real line. This result is also extended to the setting of locally…

We first introduce the arithmetic subderivative of a positive integer with respect to a non-empty set of primes. This notion generalizes the concepts of the arithmetic derivative and arithmetic partial derivative. More generally, we then…

In this work we provide a characterization of distinct type of (linear and non-linear) maps between Banach spaces in terms of the differentiability of certain class of Lipschitz functions. Our results are stated in an abstract bornological…

The purpose of this survey is a comprehensive study of operator Lip\-schitz functions. A continuous function $f$ on the real line ${\Bbb R}$ os called operator Lipschitz if $\|f(A)-f(B)\|\le\operatorname{const}\|A-B\|$ for arbitrary…

The purpose of this survey article is a comprehensive study of operator Lipschitz functions. A continuous function $f$ on the real line ${\Bbb R}$ is called operator Lipschitz if $\|f(A)-f(B)\|\le{\rm const}\|A-B\|$ for arbitrary…

In the article the necessary and sufficient conditions for a representation of Lipschitz function of two variables as a difference of two convex functions are formulated. An algorithm of this representation is given. The outcome of this…

Let $X$ be a separable Banach space with a separating polynomial. We show that there exists $C\geq 1$ (depending only on $X$) such that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and every $\epsilon>0$, there exists a…

In this paper we investigate the approximation of continuous functions on the Wasserstein space by smooth functions, with smoothness meant in the sense of Lions differentiability. In particular, in the case of a Lipschitz function we are…

We show how to determine whether two given real polynomial functions of a single variable are Lipschitz equivalent by comparing the values and also the multiplicities of the given polynomial functions at their critical points. Then we show…

Rademacher theorem states that every Lipschitz function on the Euclidean space is differentiable almost everywhere, where "almost everywhere" refers to the Lebesgue measure. In this paper we prove a differentiability result of similar type,…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene's partial recursive…

Let $0 \leq \alpha<n$, $M_{\alpha}$ be the fractional maximal operator, $M^{\sharp}$ be the sharp maximal operator and $b$ be the locally integrable function. Denote by $[b, M_{\alpha}]$ and $[b, M^{\sharp}]$ be the commutators of the…