相关论文: Algorithmic aspects of Lipschitz functions

We prove that a functional with Lipschitzian derivative, when restricted to suitable spheres centered at a noncritical point, has a unique maximum.

We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given.…

We conjecture that whenever $M$ is a metric space of density at most continuum, then the space of Lipschitz functions is $w^*$-separable. We prove the conjecture for several classes of metric spaces including all the Banach spaces with a…

We prove the existence and uniqueness of a discrete nonnegative harmonic function for a random walk satisfying finite range, centering and ellipticity conditions, killed when leaving a globally Lipschitz domain in $\mathbb{Z}^d$. Our method…

We prove that, for r>2, the r-variation and oscillation for the smooth truncations of the Cauchy transform on Lipschitz graphs are bounded in L^p for 1<p finite. The analogous result holds for the n-dimensional Riesz transform on…

The classical Rellich inequalities imply that the $L^2$-norms of the normal and tangential derivatives of a harmonic function are equivalent. In this note, we prove several refined inequalities, which make sense even if the domain is not…

Under mild assumptions, we prove that any random multifunction can be represented as the set of minimizers of an infinitely many differentiable normal integrand, which preserves the convexity of the random multifunction. We provide several…

We study the behavior of Lipschitz functions on intrinsic $C^1$ submanifolds of Heisenberg groups: our main result is their almost everywhere tangential Pansu differentiability. We also provide two applications: a Lusin-type approximation…

We show that any smooth bi-Lipschitz $h$ can be represented exactly as a composition $h_m \circ ... \circ h_1$ of functions $h_1,...,h_m$ that are close to the identity in the sense that each $\left(h_i-\mathrm{Id}\right)$ is Lipschitz, and…

We correct Miyabe's proof of van Lambalgen's Theorem for truth-table Schnorr randomness (which we will call uniformly relative Schnorr randomness). An immediate corollary is one direction of van Lambalgen's theorem for Schnorr randomness.…

We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a…

In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number we want to divide by is not zero. In many cases, any real…

In this paper, using the tools from the lineability theory, we distinguish certain subsets of $p$-adic differentiable functions. Specifically, we show that the following sets of functions are large enough to contain an infinite dimensional…

We show that no matter what subset of a normed space is given, a typical 1-Lipschitz mapping into a Banach space is non-differentiable at a typical point of the set in a very strong sense: the derivative ratio approximates, on arbitrary…

Given a connected finite graph $G$, an integer-valued function $f$ on $V(G)$ is called $M$-Lipschitz if the value of $f$ changes by at most $M$ along the edges of $G$. In 2013, Peled, Samotij, and Yehudayoff showed that random $M$-Lipschitz…

The question of whether it is possible to compute scattering resonances of Schr\"odinger operators - independently of the particular potential - is addressed. A positive answer is given, and it is shown that the only information required to…

It is known that the bi-Lipschitz right classification of function germs admit moduli. In this article we introduce a notion called the Lipschitz simple function germs and present a full classification in the complex case. A surprising…

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…

This paper shows how to use Computational Algebra techniques, namely the decomposition of rational functions in one variable, to explore a certain set of modular functions, called replicable functions, that arise in Monstrous Moonshine. In…

A generalization of Hurwitz stable polynomials to real rational functions is considered. We establishe an analogue of the Hurwitz stability criterion for rational functions and introduce a new type of determinants that can be treated as a…