We characterize intrinsic Lipschitz functions as maps which can be approximated by a sequence of smooth maps, with pointwise convergent intrinsic gradient. We also provide an estimate of the Lipschitz constant of an intrinsic Lipschitz function in terms of the L∞−norm of its intrinsic gradient.

The Lipschitz constant of a finite normal–form game is the maximal change in some player's payoff when a single opponent changes his strategy. We prove that games with small Lipschitz constant admit pure ǫ-equilibria, and pinpoint the maximal Lipschitz constant that is sufficient to imply existence of pure ǫ-equilibrium as a function of the number of players in the game and the number of strate...

This paper aims to investigate properties of involution palindrome languages. Let θ be either a morphic or antimorphic involution. we show that if θ is an antimorphic involution, then the set of all θ-palindrome words is a proper subset of all skew θ-palindrome words. We give a characterization for that a word is skew θ-palindrome. That is, A word is skew θ-palindrome if and only if it is a pro...

An infinte word w avoids a pattern p with the involution θ if there is no substitution for the variables in p and no involution θ such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the size of the alphabet. For example, it is shown that the pattern α θ (α)α can be avoided over three letters but not two letters, whereas it is well known that α...