A characterization of rational amalgamation operations
โ Scribed by Vincenzo Cutello; Javier Montero
- Book ID
- 108017858
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 827 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## In a previous result concerning Meyniel graphs, the authors defined an operation for composing graphs. This operation constructs from two graphs G1 and G2 a new graph G1 0 G2, called the amalgam of G1 and G2. If G1 and G2 are Meyniel graphs then G1 0 G2 is also a Meyniel graph. Similarly if G1
Let G be a group, let U(G) denote the set of unbounded operators on L 2 (G) which are affiliated to the group von Neumann algebra W(G) of G, and let D(G) denote the division closure of CG in U(G). Thus D(G) is the smallest subring of U(G) containing CG which is closed under taking inverses. If G is