Let T be an orientation-preserving Lipschitz expanding map of the circle T. A pre-image selector is a map τ : T → T with finitely many discontinuities, each of which is a jump discontinuity, and such that τ (x) ∈ T(x) for all x ∈ T. The closure of the image of a pre-image selector is called a flower, and a flower with p connected components is called a p-flower. We say that a real-valued Lipsch...

We show that any Lipschitz projection-valued function p on a connected closed Riemannian manifold can be approximated uniformly by smooth projection-valued functions q with Lipschitz constant close to that of p. This answers a question of Rieffel.

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these games. We begin by studying Lipschitz games, which encompass, for example, all concave games with Lipschitz continuous payoff functions. We provide an efficient...

This is one of a series of papers examining the interplay between differentiation theory for Lipschitz maps, X → V , and bi-Lipschitz nonembeddability, where X is a metric measure space and V is a Banach space. Here, we consider the case V = L, where differentiability fails. We establish another kind of differentiability for certain X , including R and H, the Heisenberg group with its Carnot-Ca...

This paper investigates global asymptotic stability (GAS) and global exponential stability (GES) of a class of continuous-time recurrent neural networks. First, we introduce a necessary and sufficient condition for existence and uniqueness of equilibrium of the neural networks with Lipschitz continuous activation functions. Next, we present two sufficient conditions to ascertain the GAS of the ...

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these games. We begin by studying Lipschitz games, which encompass, for example, all concave games with Lipschitz continuous payoff functions. We provide an efficient...

Let be a strictly positive continuous weight function on 0; 1], and n 2 N. We indicate { for certain classes of functions { how to nd (x 0 =)0 < x 1 < < x n < 1(= x n+1) and real