Tensor decompositions on simplicial complexes with invariance
From MaRDI portal
Publication:6192536
Abstract: We develop a framework to analyse invariant decompositions of elements of tensor product spaces. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group action. We prove that this decomposition exists for all invariant tensors after possibly enriching the simplicial complex. As a special case we recover tensor networks with translational invariance and the symmetric tensor decomposition. We also define an invariant separable decomposition and purification form, and prove similar existence results. Associated to every decomposition there is a rank, and we prove several inequalities between them. For example, we show by how much the rank increases when imposing invariance in the decomposition, and that the tensor rank is the largest of all ranks. Finally, we apply our framework to nonnegative tensors, where we define a nonnegative and a positive semidefinite decomposition on arbitrary simplicial complexes with group action. We show a correspondence to the previous ranks, and as a very special case recover the nonnegative, the positive semidefinite, the completely positive and the completely positive semidefinite transposed decomposition.
Recommendations
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 8209 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- A counterexample to Comon's conjecture
- Approximate tensor decompositions: disappearance of many separations
- Comon's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors
- Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone
- Exponential lower bounds for polytopes in combinatorial optimization
- Expressing combinatorial optimization problems by linear programs
- Lifts of Convex Sets and Cone Factorizations
- Mixed states in one spatial dimension: decompositions and correspondence with nonnegative matrices
- Most tensor problems are NP-hard
- Open problems in the theory of completely positive and copositive matrices
- PEPS as ground states: degeneracy and topology
- Positive semidefinite rank
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
This page was built for publication: Tensor decompositions on simplicial complexes with invariance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192536)