Related papers: Structured Symmetric Tensors
Perfect tensors are the tensors corresponding to the absolutely maximally entangled states, a special type of quantum states of interest in quantum information theory. We establish a method to compute parameterized families of perfect…
In this paper, it is proved that (strict) copositivity of a symmetric tensor $\mathcal{A}$ is equivalent to the fact that every principal sub-tensor of $\mathcal{A}$ has no a (non-positive) negative $H^{++}$-eigenvalue. The necessary and…
We present an orthogonal matrix outer product decomposition for the fourth-order conjugate partial-symmetric (CPS) tensor and show that the greedy successive rank-one approximation (SROA) algorithm can recover this decomposition exactly.…
Postive semidefinite (PSD) cone is the cone of positive semidefinite matrices, and is the object of interest in semidefinite programming (SDP). A computational efficient approximation of the PSD cone is the $k$-PSD closure, $1 \leq k < n$,…
Based on symmetry consideration, quasi-one-dimensional (1D) objects, relevant to numerous observables or phenomena, can be classified into eight different types. We provide various examples of each 1D type, and discuss their Symmetry…
This paper is a manual with tips and tricks for programming tensor network algorithms with global $SU(2)$ symmetry. We focus on practical details that are many times overlooked when it comes to implementing the basic building blocks of…
This paper introduces a notion of decomposition and completion of sum-of-squares (SOS) matrices. We show that a subset of sparse SOS matrices with chordal sparsity patterns can be equivalently decomposed into a sum of multiple SOS matrices…
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…
The analysis and visualization of tensor fields is a very challenging task. Besides the cases of zeroth- and first-order tensors, most techniques focus on symmetric second-order tensors. Only a few works concern totally symmetric tensors of…
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e., it is a sum of…
We construct a family of finite element sub-complexes of the conformal complex on tetrahedral meshes and show their exactness on contractible domains. This complex includes vector fields and symmetric and traceless tensor fields, connected…
The T-product for third-order tensors has been used extensively in the literature. In this paper, we first introduce the first-order and second-order T-derivatives for the multi-vector real-valued function with the tensor T-product; and…
In this work, we consider the optimization formulation for symmetric tensor decomposition recently introduced in the Subspace Power Method (SPM) of Kileel and Pereira. Unlike popular alternative functionals for tensor decomposition, the SPM…
We propose an index of non-invertible symmetry operators in 1+1 dimensions and discuss its relation to the realizability of non-invertible symmetries on the tensor product of finite dimensional on-site Hilbert spaces on the lattice. Our…
A real symmetric tensor is orthogonally decomposable (or odeco) if it can be written as a linear combination of symmetric powers of $n$ vectors which form an orthonormal basis of $\mathbb R^n$. Motivated by the spectral theorem for real…
In this paper, we give a necessary and sufficient condition for an even order three dimensional strongly symmetric circulant tensor to be positive semi-definite. In some cases, we show that this condition is also sufficient for this tensor…
We present a hierarchy of semidefinite programs (SDPs) for the problem of fitting a shape-constrained (multivariate) polynomial to noisy evaluations of an unknown shape-constrained function. These shape constraints include convexity or…
In recent years, optimization theory has been greatly impacted by the advent of sum of squares (SOS) optimization. The reliance of this technique on large-scale semidefinite programs however, has limited the scale of problems to which it…
We provide a new characterisation of the Standard Model gauge group GSM as a subgroup of Spin(10). The new description of GSM relies on the geometry of pure spinors. We show that GSM is the subgroup that stabilises a pure spinor Psi_1 and…
We introduce the concept of strongly $r$-matrix induced ({\small SRMI}) Poisson structure, report on the relation of this property with the stabilizer dimension of the considered quadratic Poisson tensor, and classify the Poisson structures…