𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On commuting squares and subfactors

✍ Scribed by V.S Sunder

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
980 KB
Volume
101
Category
Article
ISSN
0022-1236

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Commuting Squares and Relative Entropy f
Commuting Squares and Relative Entropy for Two Subfactors
✍ Y. Watatani; J. Wierzbicki πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 366 KB

We compute Connes-StΓΆrmer relative entropy \(H(M \mid N)\) for two subfactors \(M\) and \(N\) of a type \(\mathrm{II}_{1}\) factor without assuming \(N \subset M\). If they form a commuting square, then we have \(H(M \mid N)=H(M \mid M \cap N)\). If their commutants form a commuting square, then we

Compact Kac Algebras and Commuting Squar
Compact Kac Algebras and Commuting Squares
✍ Teodor Banica πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 168 KB

We consider commuting squares of finite dimensional von Neumann algebras having the algebra of complex numbers in the lower left corner. Examples include the vertex models, the spin models (in the sense of subfactor theory), and the commuting squares associated to finite dimensional Kac algebras. To

On Commuting and Noncommuting Complexes
On Commuting and Noncommuting Complexes
✍ Jonathan Pakianathan; ErgΓΌn YalΓ§Δ±n πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 157 KB

In this paper we study various simplicial complexes associated to the commutative structure of a finite group G. We define NC(G) (resp. C(G)) as the complex associated to the poset of pairwise noncommuting (resp. commuting) sets of nontrivial elements in G. We observe that NC(G) has only one positi

On Ο‰-commuting graphs and their diameter
On Ο‰-commuting graphs and their diameters
✍ P. Raja; S. M. Vaezpour πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract Let __F__ be a field, let Ο‰ ∈ __F__, and let __n__ β©Ύ 2 be a natural number. In this paper we define the ω‐commuting graph of __M~n~__(__F__), denoted by Ξ“~Ο‰~(__M~n~__(__F__)) which is a directed graph. We prove some theorems about the strong connectivity of this graph. Also we show that