The outer product of predicates along chains, \(T(i_1, \ldots,
i_K) = f_1(i_1) \wedge \cdots \wedge f_K(i_K)\) over the box of all indices, a rank-one tensor never built: its entry is the legs' Tensor followed by the merge, and the box's sides are the chains' lengths. In the pictures of tensor networks (Bridgeman and Chubb, "Hand-waving and
Interpretive Dance: An Introductory Course on Tensor Networks", J. Phys. A 50, 2017), each count contracts a leg's index against a covector: all ones for the box, a residue class for a section.
More...
Public Attributes | |
| T | entry |
| std::array< N, K > | sides |
Detailed Description
struct dedekind::category::Box< T, K, N >
The outer product of predicates along chains, \(T(i_1, \ldots,
i_K) = f_1(i_1) \wedge \cdots \wedge f_K(i_K)\) over the box of all indices, a rank-one tensor never built: its entry is the legs' Tensor followed by the merge, and the box's sides are the chains' lengths. In the pictures of tensor networks (Bridgeman and Chubb, "Hand-waving and
Interpretive Dance: An Introductory Course on Tensor Networks", J. Phys. A 50, 2017), each count contracts a leg's index against a covector: all ones for the box, a residue class for a section.
- Template Parameters
-
T the entry. K the number of legs. N the counts.
The documentation for this struct was generated from the following file:
- src/main/modules/dedekind/category/periodic.cppm
