In this paper, we prove that into isometries and disjointness preserving linear maps from<i>C</i>₀(<i>X</i>) into<i>C</i>₀(<i>Y</i>) are essentially weighted composition operators<i>Tf</i>=<i>h</i><i>f</i> for some continuous map and some continuous scalar-valued function<i>h</i>.

The object of this paper is to establish an existence result for nonlinear inequalities for not necessarily pseudomonotone maps. As a consequence of our result, we give some existence results for variational and variational-like inequalities.

Let <i>T</i> be a compact disjointness preserving linear operator from <i>C</i>₀(<i>X</i>) into <i>C</i>₀(<i>Y</i>), where <i>X</i> and <i>Y</i> are locally compact Hausdorff spaces. We show that <i>T</i> can be represented as a norm convergent countable sum of disjoint rank one operators. More precisely, <i>T</i> = _<i>n</i> <i></i> <i>h_n</i> for a (possibly finite) sequence {<i>x_n</i> }_<i>n</i> of distinct points in <i>X</i> and a norm null sequence {<i>h_n</i> }_<i>n</i> of mutually disjoint functions in <i>C</i>₀(<i>Y</i>). Moreover, we develop a graph theoretic method to describe the spectrum of such an operator ( 2009 WILEYVCH Verlag GmbH &amp; Co. KGaA, Weinheim)

We present the recent work on the noncommutative Fourier transform for subfactors and locally compact quantum groups, a Survey.We give a short introduction to subfactors and locally compact quantum groups and their properties;the Hausdorff-Young inequality and its extremal functions;Young's inequality and its extremal pairs;uncertainty principles and its minimizers;a noncommutative sum set theorem.

For a linear isometry T: C 0 (X) C 0 (Y) of finite corank, there is a cofinite subset Y 1 of Y such that Tf| Y 1= h f is a weighted composition operator and X is homeomorphic to a quotient space of Y 1 modulo a finite subset. When X= Y, such a T is called an isometric quasi-n-shift on C 0 (X). In this case, the action of T can be implemented as a shift on a tree-like structure, called a T-tree, in M (X) with exactly n joints. The T-tree is total in M (X) when T is a shift. With these tools, we can analyze the structure of T.