Javascript must be enabled to continue!
Classification of tensor decomposition for II1 factors
View through CrossRef
In the mid thirties Murray and von Neumann found a natural way to associate a von Neumann algebra L(Γ) to any countable discrete group Γ. Classifying L(Γ) in term of Γ is a notoriously complex problem as in general the initial data tends to be lost in the von Neumann algebraic regime. An important problem in the theory of von Neumann algebras is to completely describe all possible tensor decompositions of a given group von Neumann algebra L(Γ). In this direction the main goal is to investigate how exactly a tensor decomposition of L(Γ) relates to the underlying group Γ.
In this dissertation we introduce several new classes of groups Γ for which all tensor decompositions of L(Γ) are parametrized by the canonical direct product decompositions of Γ. Specifically, we show that whenever L(Γ) = M1⊗ ̄M2 where Mi are any diffuse von Neumann algebras then there exists a non-canonical direct product decomposition Γ = Γ1 × Γ2 such that up to amplifications we have that M1 = L(Γ1) and M2 = L(Γ2). Our class include large classes of icc (infinite conjugacy class) amalgamated free products and wreath product groups. In addition we obtain similar classifications of tensor decompositions for the von Neumann algebras associated with the T0 and T1 group functors introduced by McDuff in 1969.
The University of Iowa
Title: Classification of tensor decomposition for II1 factors
Description:
In the mid thirties Murray and von Neumann found a natural way to associate a von Neumann algebra L(Γ) to any countable discrete group Γ.
Classifying L(Γ) in term of Γ is a notoriously complex problem as in general the initial data tends to be lost in the von Neumann algebraic regime.
An important problem in the theory of von Neumann algebras is to completely describe all possible tensor decompositions of a given group von Neumann algebra L(Γ).
In this direction the main goal is to investigate how exactly a tensor decomposition of L(Γ) relates to the underlying group Γ.
In this dissertation we introduce several new classes of groups Γ for which all tensor decompositions of L(Γ) are parametrized by the canonical direct product decompositions of Γ.
Specifically, we show that whenever L(Γ) = M1⊗ ̄M2 where Mi are any diffuse von Neumann algebras then there exists a non-canonical direct product decomposition Γ = Γ1 × Γ2 such that up to amplifications we have that M1 = L(Γ1) and M2 = L(Γ2).
Our class include large classes of icc (infinite conjugacy class) amalgamated free products and wreath product groups.
In addition we obtain similar classifications of tensor decompositions for the von Neumann algebras associated with the T0 and T1 group functors introduced by McDuff in 1969.
Related Results
Theoretical Foundations and Practical Applications in Signal Processing and Machine Learning
Theoretical Foundations and Practical Applications in Signal Processing and Machine Learning
Tensor decomposition has emerged as a powerful mathematical framework for analyzing multi-dimensional data, extending classical matrix decomposition techniques to higher-order repr...
Enhanced inherent strain modelling for powder-based metal additive manufacturing
Enhanced inherent strain modelling for powder-based metal additive manufacturing
(English) Metal additive manufacturing (MAM), particularly powder bed fusion using a laser beam (PBF-LB), has transformed manufacturing by enabling the production of intricate and ...
Harnessing Tensor Decomposition for High-Dimensional Machine Learning
Harnessing Tensor Decomposition for High-Dimensional Machine Learning
Tensor decomposition has gained significant attention in machine learning due to its ability to efficiently represent and process high-dimensional data. As a natural extension of m...
Gravitational Waves from Alena Tensor
Gravitational Waves from Alena Tensor
Alena Tensor is a recently discovered class of energy-momentum tensors that proposes a general equivalence of the curved path and the geodesic for the analyzed spacetimes which all...
Sign Problem in Tensor-Network Contraction
Sign Problem in Tensor-Network Contraction
We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we ...
Quantum annealing algorithms for Boolean tensor networks
Quantum annealing algorithms for Boolean tensor networks
AbstractQuantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribut...
A Contemporary and Comprehensive Survey on Streaming Tensor Decomposition
A Contemporary and Comprehensive Survey on Streaming Tensor Decomposition
<p>Tensor decomposition has been demonstrated to be successful in a wide range of applications, from neuroscience and wireless communications to social networks. In an online...
Multi-Way Data Representation: A Comprehensive Survey on Tensor Decomposition in Machine Learning
Multi-Way Data Representation: A Comprehensive Survey on Tensor Decomposition in Machine Learning
Tensor decomposition has emerged as a fundamental tool in machine learning, enabling efficient representation, compression, and interpretation of high-dimensional data. Unlike trad...

