We provide bounds on the average distance between two points uniformly and independently chosen from a compact convex subset of the s-dimensional Euclidean space.2000 Mathematics subject classification: primary 52A22; secondary 60D05.

We define and provide some basic analysis of various types of crossed products by semimultiplicative sets, and then prove a KK-theoretical descent homomorphisms for semimultiplicative sets in accord with the descent homomorphism for discrete groups.definition of equivariant KK-theory for inversely generated semigroups. In Section 9 we compare semimultiplicative set G-equivariant KK-theory with Kasparov's G-equivariant KK-theory when G is a group. Sections 11-13 occupy the proof of the descent homomorphism, which is an adaption of Kasparov's proof in [9].DESCENT HOMOMORPHISM 3 2. Semimultiplicative sets Definition 2.1. A (general) semimultiplicative set G is a set endowed with a subset G (2) ⊆ G × G and a map (written as a multiplication)satisfying the following weak associativity condition: s(tu) = (st)u whenever both expressions are defined (s, t, u ∈ G).There is a similar notion called a semigroupoid ([7]). A semigroupoid is an associative semimultiplicative set with the property that (st)u is defined if and only if st and tu is defined. For instance, groupoids and small categories are semigroupoids. In general, however, an associative semimultiplicative set is not a semigroupoid, a typical example being a ring R without the zero element, so the semimultiplicative set G = R\{0} under the multiplication inherited from R. Examples for associative semimultiplicative sets include groups, groupoids, small categories, inverse semigroups, semigroups, semigroupoids. An associative semimultiplicative set is also called a partial semigroup in the literature (see [2]).We remark that the weak associativity condition for a general semimultiplicative set is not essential in this paper. A general semimultiplicative set is always realized by associative actions, so we require the weak associativity without essential loss of generality. However, for instance, an arbitrary subset of a group is a general but not necessarily an associative semimultiplicative set. Now the point is that general and associative semimultiplicative sets G yield different classes of actions, since G has to be realized by partial isometries.If an associative semimultiplicative set G has left cancellation, that is, for all s, t 1 , t 2 ∈ G, st 1 = st 2 implies t 1 = t 2 , then we are able to define a left reduced C * -algebra for G. Write (e g

Let O be a higher rank Exel-Laca algebra generated by an alphabet A. If A contains d commuting isometries corresponding to rank d and the transition matrices do not have finite rows, then K 1 (O) is trivial and K 0 (O) is isomorphic to K 0 of the abelian subalgebra of O generated by the source projections of A.1991 Mathematics subject classification: 46L80, 46L55.

No abstract

No abstract