Related papers: Spectral norm of a symmetric tensor and its comput…

We develop the embedding formalism for conformal field theories, aimed at doing computations with symmetric traceless operators of arbitrary spin. We use an index-free notation where tensors are encoded by polynomials in auxiliary…

This article first introduces the notion of weighted singular value decomposition (WSVD) of a tensor via the Einstein product. The WSVD is then used to compute the weighted Moore-Penrose inverse of an arbitrary-order tensor. We then define…

Symmetric polynomial quadrature rules for triangles are commonly used to efficiently integrate two-dimensional domains in finite-element-type problems. While the development of such rules focuses on the maximum degree a given number of…

This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…

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…

We prove a spectral upper bound for the torsion function of symmetric stable processes that holds for convex domains in $\mathbb{R}^d$. Our bound is explicit and captures the correct order of growth in $d$, improving upon the existing…

We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3^{d/2} = (1.73)^d vertices and of centrally symmetric k-neighborly d-polytopes with about 2^{c_k d} vertices where c_k=3/20 k^2 2^k.…

In this paper, we present some checkable criteria for the spectral finiteness of a finite subset of the real $d\times d$ matrix space $\mathbb{R}^{d\times d}$, where $2\le d<\infty$.

I investigate on the number t of real eigenvectors of a real symmetric tensor. In particular, given a homogeneous polynomial f of degree d in 3 variables, i prove that t is greater or equal than 2c+1, if d is odd and t is greater or equal…

The Perron-Frobenius theorem says that the spectral radius of an irreducible nonnegative tensor is the unique positive eigenvalue corresponding to a positive eigenvector. With this in mind, the purpose of this paper is to find the spectral…

Multidimensional continuous-domain inverse problems are often solved by the minimization of a loss functional, formed as the sum of a data fidelity and a regularization. In this work, we present a new construction where the regularization…

We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor…

We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.

The wave equation for vectors and symmetric tensors in spherical coordinates is studied under the divergence-free constraint. We describe a numerical method, based on the spectral decomposition of vector/tensor components onto spherical…

A solid object's geometry, density, and elastic moduli completely determine its spectrum of normal modes. Solving the inverse problem - determining a material's elastic moduli given a set of resonance frequencies and sample geometry -…

A real binary tensor consists of $2^d$ real entries arranged into hypercube format $2^{\times d}$. For $d=2$, a real binary tensor is a $2\times 2$ matrix with two singular values. Their product is the determinant. We generalize this…

Given a knot K in an Euclidean space E and a finite dimensional space V of smooth functions on K, we express the expected number of critical points of a random function in V in terms of an integral-geometric invariant of K and V. When V…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

We establish two inequalities for the nuclear norm and the spectral norm of tensor products. The first inequality indicates that the nuclear norm of the square matrix is a matrix norm. We extend the concept of matrix norm to tensor norm. We…

We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…