Related papers: Algorithmic aspects of Lipschitz functions

One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…

A computable real function F on [0,1] is constructed such that there exists an exponential time algorithm for the evaluation of the function on [0,1] on Turing machine but there does not exist any polynomial time algorithm for the…

We give upper bounds on the Walsh coefficients of functions for which the derivative of order at least one has bounded variation of fractional order. Further, we also consider the Walsh coefficients of functions in periodic and non-periodic…

We find new bi-Lipschitz invariants for functions of two complex variables.

We give a necessary and sufficient condition for a difference of convex (DC, for short) functions, defined on a locally convex space, to be Lipschitz continuous. Our criterion relies on the intersections of the "epsilon-subdifferentials of…

Probability functions appear in constraints of many optimization problems in practice and have become quite popular. Understanding their first-order properties has proven useful, not only theoretically but also in implementable algorithms,…

We show that if n>1 then there exists a Lebesgue null set in R^n containing a point of differentiability of each Lipschitz function mapping from R^n to R^(n-1); in combination with the work of others, this completes the investigation of…

We obtain some new characterizations of a variable version of Lipschitz spaces in terms of the boundedness of commutators of sharp maximal functions, fractional maximal functions or fractional maximal commutators in the context of the…

We consider a Wright-Fisher diffusion (x(t)) whose current state cannot be observed directly. Instead, at times t1 < t2 < . . ., the observations y(ti) are such that, given the process (x(t)), the random variables (y(ti)) are independent…

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…

This paper addresses explainability of the operator-regularization approach under the use of monotone Lipschitz-gradient (MoL-Grad) denoiser -- an operator that can be expressed as the Lipschitz continuous gradient of a differentiable…

We prove and collect numerous explicit and computable results for the fractional Laplacian $(-\Delta)^s f(x)$ with $s>0$ as well as its whole space inverse, the Riesz potential, $(-\Delta)^{-s}f(x)$ with $s\in\left(0,\frac{1}{2}\right)$.…

We show that for real Banach spaces that are either separable or dual spaces, the Lipschitz numerical index coincides with the classical (linear) numerical index. This result provides partial evidence toward the question posed by Wang,…

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-\pi, \pi]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f…

We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…

We study integral representations of random variables with respect to general H\"older continuous processes and with respect to two particular cases; fractional Brownian motion and mixed fractional Brownian motion. We prove that arbitrary…

The convergence theory for the gradient sampling algorithm is extended to directionally Lipschitz functions. Although directionally Lipschitz functions are not necessarily locally Lipschitz, they are almost everywhere differentiable and…

Let $T:Y\to X$ be a bounded linear operator between two normed spaces. We characterize compactness of $T$ in terms of differentiability of the Lipschitz functions defined on $X$ with values in another normed space $Z$. Furthermore, using a…

A major open problem in computational complexity is the existence of a one-way function, namely a function from strings to strings which is computationally easy to compute but hard to invert. Levin (2023) formulated the notion of one-way…