Containments of Tensor Network Varieties
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908792187256832 |
|---|---|
| author | Mora, Sofía Garzón Haase, Christian |
| author_facet | Mora, Sofía Garzón Haase, Christian |
| contents | Building upon the work of Buczyńska et al., we study here tensor formats and their corresponding encoding of tensors via two-fold tensor products determined by the combinatorics of a binary tree. The set of all tensors representable by a given network forms the corresponding tensor network variety. A very basic question asks whether every tensor representable by one network is representable by another network, namely, when one tensor network variety is contained in another. Specific instances of this question became known as the Hackbusch Conjecture. Here, we propose a general framework for this question and take first steps, theoretical as well as experimental, towards a better understanding. In particular, given any two binary trees on $n$ leaves, we define (and prove existence of) a new measure, the containment exponent, which gauges how much one has to boost the parameters of one network for the containment to hold. We present an algorithm for bounding these containment exponents of tensor network varieties and report on an exhaustive search among trees on up to $n=8$ leaves. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_19805 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Containments of Tensor Network Varieties Mora, Sofía Garzón Haase, Christian Combinatorics Algebraic Geometry Optimization and Control 15A69 (primary), 14M12, 05C05, 65F99 (secondary) Building upon the work of Buczyńska et al., we study here tensor formats and their corresponding encoding of tensors via two-fold tensor products determined by the combinatorics of a binary tree. The set of all tensors representable by a given network forms the corresponding tensor network variety. A very basic question asks whether every tensor representable by one network is representable by another network, namely, when one tensor network variety is contained in another. Specific instances of this question became known as the Hackbusch Conjecture. Here, we propose a general framework for this question and take first steps, theoretical as well as experimental, towards a better understanding. In particular, given any two binary trees on $n$ leaves, we define (and prove existence of) a new measure, the containment exponent, which gauges how much one has to boost the parameters of one network for the containment to hold. We present an algorithm for bounding these containment exponents of tensor network varieties and report on an exhaustive search among trees on up to $n=8$ leaves. |
| title | Containments of Tensor Network Varieties |
| topic | Combinatorics Algebraic Geometry Optimization and Control 15A69 (primary), 14M12, 05C05, 65F99 (secondary) |
| url | https://arxiv.org/abs/2601.19805 |