Related papers: Minimality of Tree Tensor Network Ranks
We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…
This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…
We consider planar networks of three curves that meet at two junctions with prescribed equal angles, minimizing a combination of the elastic energy and the length functional. We prove existence and regularity of minimizers, and we show some…
The {\em atom-bond connectivity (ABC) index} is a degree-based graph topological index that found chemical applications. The problem of complete characterization of trees with minimal $ABC$ index is still an open problem.…
This paper studies the possibility of detecting and isolating topology failures (including link failures and node failures) of a networked system from subsystem measurements, in which subsystems are of fixed high-order linear dynamics, and…
A nonnegative tensor has nonnegative rank at most 2 if and only if it is supermodular and has flattening rank at most 2. We prove this result, then explore the semialgebraic geometry of the general Markov model on phylogenetic trees with…
Tensor-ring decomposition of tensors plays a key role in various applications of tensor network representation in physics as well as in other fields. In most heuristic algorithms for the tensor-ring decomposition, one encounters the problem…
Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…
Trellises provide a graphical representation for the row space of a matrix. The product construction of Kschischang and Sorokine builds minimal conventional trellises from matrices in minimal span form. Koetter and Vardy showed that minimal…
Real-world complex systems exhibit multiple levels of relationships. In many cases, they require to be modeled by interconnected multilayer networks, characterizing interactions on several levels simultaneously. It is of crucial importance…
In 2018, M. Chu and S. Tillmann gave a lower bound for the trisection genus of a closed 4-manifold in terms of the Euler characteristic of $M$ and the rank of its fundamental group. We show that given a group $G$, there exist a 4-manifold…
We prove a conjecture of W.~Hackbusch in a bigger generality than in our previous article. Here we consider Tensor Train (TT) model with an arbitrary number of leaves and a corresponding "almost binary tree" for Hierarchical Tucker (HT)…
Researchers in condensed matter physics recently study two-dimensional topological order in terms of tensor networks involving certain 3- and 4-tensors. Their 3-tensors satisfying the "zipper condition" play an important role there and such…
A tensor network is a type of decomposition used to express and approximate large arrays of data. A given data-set, quantum state or higher dimensional multi-linear map is factored and approximated by a composition of smaller multi-linear…
In this note we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of $\mathbb{R}^2$ composed of straight segments joining at triple junctions forming angles…
Formulating non-Abelian gauge theories as a tensor network is known to be challenging due to the internal degrees of freedom that result in the degeneracy in the singular value spectrum. In two dimensions, it is straightforward to 'trace…
An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\Psi(G)$. In this paper, an algorithm to count…
Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$…
We investigate the disordered spin-$\frac12$Heisenberg model in two dimensions and employ tree tensor networks (TTNs) with a physics-informed structural optimization of the tree layout, to simulate dynamics in the many-body localization…