hold for all Lipschitz functions w : Ω̄ → R with w|∂Ω = 0. Here Ω is a bounded Lipschitz domain in R and ∇w = (w xα) is the Jacobi matrix of w defined pointwise on Ω. There has been a considerable amount of work on Morrey’s quasiconvexity in the calculus of variations and nonlinear elasticity [3, 5, 8, 9, 10]. Integral estimates like (1.1) are also important for other problems in geometric mappi...

In this paper, we are interested in the numerical solutions of stochastic functional differential equations (SFDEs) with jumps. Under the global Lipschitz condition, we show that the pth moment convergence of the Euler-Maruyama (EM) numerical solutions to SFDEs with jumps has order 1/p for any p ≥ 2. This is significantly different from the case of SFDEs without jumps where the order is 1/2 for...

A set S R d is C-Lipschitz in the x i-coordinate, where C > 0 is a real number, if for every two points a; b 2 S, we have ja i ? b i j C maxfja j ? b j j : j = 1; 2 Motivated by a problem of Laczkovich, the author asked whether every n-point set in R d contains a subset of size at least cn 1?1=d that is C-Lipschitz in one of the coordinates, for suitable constants C and c > 0 (depending on d). ...

In this paper we characterise, in terms of the upper Dini derivative, when the Clarke subdiierential mapping of a real-valued locally Lipschitz function is a minimal weak cusco. We then use this characterisation to deduce some new results concerning Lips-chitz functions with minimal subdiierential mappings. In the papers 7] and 1], the authors investigate a class of locally Lipschitz functions ...

Sensitivity analysis provides useful information for equation-solving, optimization, and post-optimality analysis. However, obtaining useful sensitivity information for systems with nonsmooth dynamic systems embedded is a challenging task. In this article, for any locally Lipschitz continuous mapping between finitedimensional Euclidean spaces, Nesterov’s lexicographic derivatives are shown to b...

We answer a question of Aharoni by showing that every separable metric space can be Lipschitz 2-embedded into c0 and this result is sharp; this improves earlier estimates of Aharoni, Assouad and Pelant. We use our methods to examine the best constant for Lipschitz embeddings of the classical `p-spaces into c0 and give other applications. We prove that if a Banach space embeds almost isometrical...

The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both the relative randomness and the relative computational power of real numbers. This paper proves that the computable Lipschitz degrees of computably enumerable sets are not dense. An immediate corollary is that the Solo...

Consider a bounded open set U ⊂ Rn and a Lipschitz function g : ∂U → Rm. Does this function always have a canonical optimal Lipschitz extension to all of U? We propose a notion of optimal Lipschitz extension and address existence and uniqueness in some special cases. In the case n = m = 2, we show that smooth solutions have two phases: in one they are conformal and in the other they are variant...

Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a single real value). In this paper, we study efficiently computable Lipschitz extensions for multi-dimensional (that is, vector-valued) functions on graphs. We...