Related papers: Coupled KPZ equations and their decoupleability

We study three different quasi-symmetry models and three different mixture models of $n\times n\times n$ tensors for modeling rater agreement data. For these models we give a geometric description of the associated varieties and we study…

Tensor decomposition plays a key role in identifying common features across a collection of matrices in many areas of science. A fundamental need in big data research is to process data tabulated as large-scale matrices using eigenvectors.…

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…

The study of cosmological correlators, and more generally Feynman integrals, is greatly aided by considering them as solutions to differential equations. Often, such systems of differential equations are reducible, which, broadly speaking,…

Stimulated by odd-bipartite and even-bipartite hypergraphs, we define odd-bipartite (weakly odd-bipartie) and even-bipartite (weakly even-bipartite) tensors. It is verified that all even order odd-bipartite tensors are irreducible tensors,…

This paper characterizes two forms of separability of pure states of systems of n qubits: (i) into a tensor product of n qubit states, and (ii), into a tensor product of 2 subsystems states of p and q qubits respectively with p+q=n. For…

In this article, we mainly give the strictly copositive conditions of a special class of third order three dimensional symmetric tensors. More specifically, by means of the polynomial decomposition method, the analytic sufficient and…

This paper concerns the multi-component coupled Kardar-Parisi-Zhang (KPZ) equation and its two types of approximations. One approximation is obtained as a simple replacement of the noise term by a smeared noise with a proper…

In [13], Hillar and Lim famously demonstrated that "multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard". Despite many recent advancements, the state-of-the-art methods for…

We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…

We provide an in-depth study of tripartite entanglement of qudits. We start with a short review of tripartite entanglement invariants, prove a theorem about the complete list of all allowed values of three (out of the total of four) such…

Conjugate partial-symmetric (CPS) tensor is a generalization of Hermitian matrices. For the CPS tensor decomposition some properties are presented. For real CPS tensors in particular, we note the subtle difference from the complex case of…

A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are defined by a decomposable 3-vector field. The key point is the proof of a lemma which tells…

We present a novel analysis of the dynamics of tensor power iterations in the overcomplete regime where the tensor CP rank is larger than the input dimension. Finding the CP decomposition of an overcomplete tensor is NP-hard in general. We…

Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…

We introduce a general framework for detecting genuine multipartite entanglement and non full-separability in multipartite quantum systems of arbitrary dimensions based on correlation tensors. Regarding genuine multipartite entanglement our…

A cogent theory of collective multipole-like quantum correlations in symmetric multiqubit states is presented by employing SO(3) irreducible spherical tensor representation. An arbitrary bipartite division of this system leads to a family…

In this paper we study the problem of decomposing a given tensor into a tensor train such that the tensors at the vertices are orthogonally decomposable. When the tensor train has length two, and the orthogonally decomposable tensors at the…

Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine…

We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…