Related papers: Tensor Codes and their Invariants
We introduce a new tensor norm, the average spectrum norm, to study sample complexity of tensor completion problems based on the canonical polyadic decomposition (CPD). Properties of the average spectrum norm and its dual norm are…
Sparse tensor networks are commonly used to represent contractions over sparse tensors. Tensor contractions are higher-order analogs of matrix multiplication. Tensor networks arise commonly in many domains of scientific computing and data…
Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…
Our basic objects are partitions of finite sets of points into disjoint subsets. We investigate sets of partitions which are closed under taking tensor products, composition and involution, and which contain certain base partitions. These…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…
Theory of numerical range and numerical radius for tensors is not studied much in the literature. In 2016, Ke {\it et al.} [Linear Algebra Appl., 508 (2016) 100-132] introduced first the notion of numerical range of a tensor via the…
A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…
We study decomposable N^d-indexed persistence modules via higher dimensional partitions. Their barcodes are defined in terms of the extended interior of the corresponding Young diagrams. For two decomposable N^d-indexed persistence modules,…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…
The multidimensional convolutional codes are an extension of the notion of convolutional codes (CCs) to several dimensions of time. This paper explores the class of two-dimensional convolutional codes (2D CCs) and 2D tail-biting…
We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix…
The purpose of this article is to give a complete and general answer to the recurrent problem in continuum mechanics of the determination of the number and the type of symmetry classes of an even-order tensor space. This kind of…
We study odd-dimensional modular tensor categories and maximally non-self dual (MNSD) modular tensor categories of low rank. We give lower bounds for the ranks of modular tensor categories in terms of the rank of the adjoint subcategory and…
In [Phys. Rev. A 58, 1833 (1998)] a family of polynomial invariants which separate the orbits of multi-qubit density operators $\rho$ under the action of the local unitary group was presented. We consider this family of invariants for the…
Tensor networks developed in the context of condensed matter physics try to approximate order-$N$ tensors with a reduced number of degrees of freedom that is only polynomial in $N$ and arranged as a network of partially contracted smaller…
Unlike the matrix case, computing low-rank approximations of tensors is NP-hard and numerically ill-posed in general. Even the best rank-1 approximation of a tensor is NP-hard. In this paper, we use convex optimization to develop…
We introduce tensor numerical techniques for solving optimal control problems constrained by elliptic operators in $\mathbb{R}^d$, $d=2,3$, with variable coefficients, which can be represented in a low rank separable form. We construct a…
Matrix models with continuous symmetry are powerful tools for studying quantum gravity and holography. Tensor models have also found applications in holographic quantum gravity. Matrix models with discrete permutation symmetry have been…
We initiate the systematic study of modular representations of symmetric groups that arise via the braiding in (symmetric) tensor categories over fields of positive characteristic. We determine what representations appear for certain…