A bott periodicity map for crossed products of C*-algebras by discrete groups

A generalization is given of the canonical map from a discrete group into K ₁ of the group C ^*-algebra. Our map also generalizes Rieffel's construction of a projection in an irrational rotation C ^*-algebra.     

2-Groupoid Enrichments in Homotopy Theory and Algebra

The use of groupoid enrichments in abstract homotopy theory is well known and classical. Recently enrichments by higher-dimensional groupoids have been considered. Here we will describe enrichment by 2-groupoids with respect to the Gray tensor product and will examine several examples (2-groupoids, 2-crossed complexes, chain complexes, etc.) from an elementary view-point. The enrichment of the category of chain complexes is examined in detail and questions of the existence of analogues of classical constructions (categories over B, under A, etc.) are explored.     

On the tensor algebra of a non-abelian group and applications

We introduce the tensor algebra J() of a crossed complex and give its relations with the James construction for a filtered space. For a group G, we define via multi-derivations the derived algebra I _* G which is isomorphic to the algebra C(JG) of chains on JG We derive from a certain exact sequence for the homology H*JG applications to the homotopy of the suspended classifying space BG.     

Rieffel projections in certain transformation group C*-algebras

LetA be the transformation groupC ^*-algebra associated with an arbitrary orientation-preserving homeomorphism of . ThisC ^*-algebra contains an infinite family of projections, called Rieffel projections, each of which generates theK ₀-groupK ₀(A). Although these projections must beK-theoretically equivalent, it is easy to see that most are not Murray-von Neumann equivalent. The mystery of how large the matrix algebra must be to implement theK-theory equivalence, is solved by explicitly constructing the equivalence in the smallest possible algebra:A with unit adjoined.Partially supported by NSF Grant DMS 8901923.     

On maximal injective subalgebras in a <Emphasis Type="Italic">w</Emphasis>Γ factor

Let (F _ℚ) × _α ℤ be the crossed product von Neumann algebra of the free group factor (F _ℚ), associated with the left regular representation λ of the free group F _ℚ with the set {u _r : r ∈ ℚ} of generators, by an automorphism α defined by α(λ(u _r )) = exp(2πri)λ(u _r ), where ℚ is the rational number set. We show that (F _ℚ) × _α ℤ is a wΓ factor, and for each r ∈ ℚ, the von Neumann subalgebra generated in (F _ℚ) × _α ℚ by λ(u _r ) and υ is maximal injective, where υ is the unitary implementing the automorphism α. In particular, (F _ℚ) × _α ℣ is a wΓ factor with a maximal abelian selfadjoint subalgebra which cannot be contained in any hyperfinite type II₁ subfactor of (F _ℚ) × _α ℚ. This gives a counterexample of Kadison’s problem in the case of wΓ factor. This work was supported by the National Natural Science Foundation of China (Grant Nos. 10201007, A0324614) and the Natural Science Foundation of Shandong Province (Grant No. Y2006A03)     

The pressure in operator algebras

We introduce two notions of the pressure in operator algebras, one is the pressure Pα（π, T） for an automorphism α of a unital exact C^＊-algebra A at a self-adjoint element T in A with respect to a faithful unital ＊-representation π the other is the pressure Pτ,α（T） for an automorphism α of a hyperfinite von Neumann algebra M at a self-adjoint element T in M with respect to a faithful normal α-invariant state τ. We give some properties of the pressure, show that it is a conjugate invaxiant, and also prove that the pressure of the implementing inner automorphism of a crossed product A×α Z at a self-adjoint operator T in A equals that of α at T.     

冯·诺依曼代数交叉积的一点注记

设α是可数离散群G和H的半直积G■_σH在冯·诺依曼代数M上的作用,则β_h=α_((e,h))AdU_h定义了群H在冯·诺依曼代数交叉积M■_αG上的作用β.本文证明了交叉积冯·诺依曼代数M■_α(G■_σH)与(M■_αG)■_βH是*-同构的,因此在一定条件下,冯·诺依曼代数的交叉积满足结合律.     

Exponential behaviour of the Butkovi?-Zimmermann algorithm for solving two-sided linear systems in max-algebra

In [P. Butkovi?, K. Zimmermann, A strongly polynomial algorithm for solving two-sided linear systems in max-algebra, Discrete Applied Mathematics 154 (3) (2006) 437-446] an ingenious algorithm for solving systems of two-sided linear equations in max-algebra was given and claimed to be strongly polynomial. However, in this note we give a sequence of examples showing exponential behaviour of the algorithm. We conclude that the problem of finding a strongly polynomial algorithm is still open.