Tensor decompositions on simplicial complexes with invariance

DOI10.1016/J.JSC.2024.102299arXiv1909.01737OpenAlexW2971766044MaRDI QIDQ6192536FDOQ6192536

Tim Netzer, Matt Hoogsteder Riera, Gemma De las Cuevas

Publication date: 11 March 2024

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1909.01737

zbMATH Keywords

group actionpositivitytensor decompositionquantum many-body systems

Mathematics Subject Classification ID

Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Spinor and twistor methods applied to problems in quantum theory (81R25) Many-body theory; quantum Hall effect (81V70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Most Tensor Problems Are NP-Hard
• Expressing combinatorial optimization problems by linear programs
• Lifts of Convex Sets and Cone Factorizations
• Symmetric tensor decomposition
• Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
• Symmetric Tensors and Symmetric Tensor Rank
• Positive semidefinite rank
• Exponential lower bounds for polytopes in combinatorial optimization
• Title not available (Why is that?)
• PEPS as ground states: degeneracy and topology
• A Counterexample to Comon's Conjecture
• Open problems in the theory of completely positive and copositive matrices
• Comon's conjecture, rank decomposition, and symmetric rank decomposition of symmetric tensors
• Approximate tensor decompositions: Disappearance of many separations
• Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices

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)