arXiv · 1501.01120
Hackbusch Conjecture on tensor formats
Abstract
We prove a conjecture of W. Hackbusch about tensor network states related to a perfect binary tree and train track tree. Tensor network states are used to present seemingly complicated tensors in a relatively simple and efficient manner. Each such presentation is described by a binary tree and a collection of vector spaces, one for each vertex of the tree. A problem suggested by Wolfgang Hackbusch and Joseph Landsberg is to compare the complexities of encodings, if one presents the same tensor with respect to two different trees. We answer this question when the two trees are extremal cases: the most "spread" tree (perfect binary tree), and the "deepest" binary tree (train track tree). The corresponding tensor formats are called hierarchical formats (HF) and tensor train (TT) formats, respectively.
Explore related subjects
Keep this discovery
Weronika Buczyńska, Jarosław Buczyński, Mateusz Michałek. 2015-01-06. Hackbusch Conjecture on tensor formats. https://doi.org/10.1016/j.matpur.2015.05.002
Cite the original work for its findings. Save a collection to share your selection of sources.