Related papers: The geometry of rank-one tensor completion
The tensor rank decomposition problem consists of recovering the unique set of parameters representing a robustly identifiable low-rank tensor when the coordinate representation of the tensor is presented as input. A condition number for…
We compute the expected value of powers of the geometric condition number of random tensor rank decompositions. It is shown in particular that the expected value of the condition number of $n_1\times n_2 \times 2$ tensors with a random…
Fix integers $m \ge 2$, $s\ge 5$ and $d\ge 2s+2$. Here we describe the possible symmetric tensor ranks $\le 2d+s-7$ of all symmetric tensors (or homogeneous degree $d$ polynomials) in $m+1$ variables with border rank $s$.
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
This is a survey primarily about determining the border rank of tensors, especially those relevant for the study of the complexity of matrix multiplication. This is a subject that on the one hand is of great significance in theoretical…
This paper conducts a rigorous analysis for provable estimation of multidimensional arrays, in particular third-order tensors, from a random subset of its corrupted entries. Our study rests heavily on a recently proposed tensor algebraic…
The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…
We present the theory of rank-metric codes with respect to the 3-tensors that generate them. We define the generator tensor and the parity check tensor of a matrix code, and describe the properties of a code through these objects. We define…
The main goal of this paper is to study the geometric structures associated with the representation of tensors in subspace based formats. To do this we use a property of the so-called minimal subspaces which allows us to describe the tensor…
Consider recovering a rank-one tensor of size $n_1 \times \cdots \times n_d$ from exact or noisy observations of a few of its entries. We tackle this problem via semidefinite programming (SDP). We derive deterministic combinatorial…
The determination of the maximal ranks of a set of a given type of tensors is a basic problem both in theory and application. In statistical applications, the maximal rank is related to the number of necessary parameters to be built in a…
Universal representation of geometric patterns of disordered matters is investigated with the aid of general topology. By utilizing the result obtained in the previous study (S. Ohmori, et.al., Phys. Scr. 94, 105213 (2019)) that any…
We are interested in the estimation of a rank-one tensor signal when only a portion $\varepsilon$ of its noisy observation is available. We show that the study of this problem can be reduced to that of a random matrix model whose spectral…
We show that a quadratic form of quantum geometric tensor in $k$-space sets a bound on the $q^4$ term in the static structure factor $S(q)$ at small $\vec{q}$. Bands that saturate this bound satisfy a condition similar to Laplace's…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…
The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…
A set of new tensors of purely geometric origin have been investigated, which form a hierarchy. A tensor of a lower rank plays the role of the potential for the tensor of one rank higher. The tensors have interesting mathematical and…
A bounded subset of a normed linear space is said to be (diametrically) complete if it cannot be enlarged without increasing the diameter. A complete super set of a bounded set $K$ having the same diameter as $K$ is called a completion of…
We show that the algebraic rank of divisors on certain graphs is related to the realizability problem of matroids. As a consequence, we produce a series of examples in which the algebraic rank depends on the ground field. We use the theory…
Matrix completion, the problem of completing missing entries in a data matrix with low dimensional structure (such as rank), has seen many fruitful approaches and analyses. Tensor completion is the tensor analog, that attempts to impute…