Related papers: Algorithmic aspects of Lipschitz functions

An invertible function is bi-Lipschitz if both the function and its inverse have bounded Lipschitz constants. Nowadays, most Normalizing Flows are bi-Lipschitz by design or by training to limit numerical errors (among other things). In this…

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

We consider the behaviour of holomorphic functions on a bounded open subset of the plane, satisfying a Lipschitz condition with exponent $\alpha$, with $0<\alpha<1$, in the vicinity of an exceptional boundary point where all such functions…

We consider a functional calculus for compact operators, acting on the singular values rather than the spectrum, which appears frequently in applied mathematics. Necessary and sufficient conditions for this singular value functional…

The natural forms of the Leibniz rule for the $k$th derivative of a product and of Fa\`a di Bruno's formula for the $k$th derivative of a composition involve the differential operator $\partial^k/\partial x_1 ... \partial x_k$ rather than…

We define Schwartz functions, tempered functions and tempered distributions on (possibly singular) real algebraic varieties. We prove that all classical properties of these spaces, defined previously on affine spaces and on Nash manifolds,…

We construct a differentiable locally Lipschitz function $f$ in $\mathbb{R}^{N}$ with the property that for every convex body $K\subset \mathbb{R}^N$ there exists $\bar x \in \mathbb{R}^N$ such that $K$ coincides with the set $\partial_L…

In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorr's theorem. We also study randomness from the view point of…

Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…

We verify the existence of a purely unrectifiable set in which the typical Lipschitz function has a large set of full differentiability points. The example arises from a construction, due to Cs\"ornyei, Preiss and Ti\v{s}er, of a universal…

Let f be a computable function from finite sequences of 0's and 1's to real numbers. We prove that strong f-randomness implies strong f-randomness relative to a PA-degree. We also prove: if X is strongly f-random and Turing reducible to Y…

We present a study of real Hurwitz numbers enumerating a special kind of real meromorphic functions, which we call simple framed purely real functions. We deduce partial differential equations of cut-and-join type for generating functions…

Real or complex polynomial mappings between affines spaces admitting a Lipschitz-trivial value are completely characterized.

In this paper, the main aim is to consider the boundedness of commutators of multilinear Calder\'{o}n-Zygmund operators with Lipschitz functions in the context of the variable exponent Lebesgue spaces. Furthermore, the variable versions of…

We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

It was already known that a p-adic, locally Lipschitz continuous semi-algebraic function is piecewise Lipschitz continuous, where the pieces can be taken semi-algebraic. We prove that if the function has locally Lipschitz constant 1, then…

We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.

Probability functions figure prominently in optimization problems of engineering. They may be nonsmooth even if all input data are smooth.This fact motivates the consideration of subdifferentials for such typically just continuous…

Lusztig's algorithm of computing generalized Green functions of reductive groups involves an ambiguity of certain scalars. In this paper, for reductive groups of classical type with arbitrary characteristic, we determine those scalars…