Skip Navigation

Journal of the London Mathematical Society 1995 51(1):148-160; doi:10.1112/jlms/51.1.148
© 1995 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Harrison, K.J.
Right arrow Articles by Mueller, U.A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The London Mathematical Society

Decomposability of Reflexive Cycle Algebras

K.J. Harrison and U.A. Mueller

Mathematics Department, Murdoch University Murdoch, Western Australia 6150, Australia E-mail: harrison{at}csuvaxl.murdoch.edu.au
Department of Mathematics, Edith Cowan University Perth, Western Australia 6050, Australia E-mail: u.mueller{at}cowan.edu.au

Received 19 January 1993. Revision received 14 June 1993.

We give, for each n ≥ 3, an example of a reflexive operator algebra An with the following properties: (i) each finite rank operator with rank less than n – 1 is the sum of rank-one operators in An, and (ii) there is an operator of rank n – 1 in An which is not the sum of rank-one operators in An. The invariant subspace lattice of An is finite and distributive with 2n join-irreducible elements. We show also that the indecomposability of An is related to the existence of a chordless cycle in a bipartite graph associated with An.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.