Tensor-stabilizer characterization for forests
Tensor-stabilizer characterization for forests
Let be a forest on vertex set , with each connected component a tree having at least three nodes, and let be its adjacency matrix. Let be the variety of symmetric tensors whose entries vanish whenever the subgraph induced by their indices is disconnected. Denote by the orthogonal group, by the signed permutation matrices, and by the permutation matrices. For , let denote the tensor symmetry group of . Forest stabilizer conjecture. Let . Then if and only if and , where is a permutation matrix such that . This would characterize all orthogonal transformations preserving the tensor zero structure induced by such a forest.
Sources & referencesView supporting material
Primary source
Marina Garrote-López and Monroe Stephenson, “Cumulant Tensors in Partitioned Independent Component Analysis”, arXiv:2402.10089 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.