相关论文: Generic uniqueness conditions for the canonical po…

We show that the spectral theorem -- which we understand to be a statement that every self-adjoint matrix admits a certain type of canonical form under unitary similarity -- admits analogues over other $*$-algebras distinct from the complex…

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…

In the present notes we provide a new uniform way to compute a canonical p-dimension of a split algebraic group G for a torsion prime p using degrees of basic polynomial invariants described by V.Kac. As an application, we compute the…

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…

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.…

Let ${\cal A}_1$ be the class of all unital separable simple $C^*$-algebras $A$ such that $A\otimes U$ has tracial rank at most one for all UHF-algebras of infinite type. It has been shown that amenable ${\cal Z}$-stable $C^*$-algebras in…

We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only…

This work considers low-rank canonical polyadic decomposition (CPD) under a class of non-Euclidean loss functions that frequently arise in statistical machine learning and signal processing. These loss functions are often used for certain…

In the first part of this paper we give a precise description of all the minimal decompositions of any bi-homogeneous polynomial $p$ (i.e. a partially symmetric tensor of $S^{d_1}V_1\otimes S^{d_2}V_2$ where $V_1,V_2$ are two complex,…

The decomposition of tensors into simple rank-1 terms is key in a variety of applications in signal processing, data analysis and machine learning. While this canonical polyadic decomposition (CPD) is unique under mild conditions, including…

We show that, if a simple $C^{*}$-algebra $A$ is topologically finite-dimensional in a suitable sense, then not only $K_{0}(A)$ has certain good properties, but $A$ is even accessible to Elliott's classification program. More precisely, we…

We determine the generic complete eigenstructures for $n \times n$ complex symmetric matrix polynomials of odd grade $d$ and rank at most $r$. More precisely, we show that the set of $n \times n$ complex symmetric matrix polynomials of odd…

One of the key problems in tensor completion is the number of uniformly random sample entries required for recovery guarantee. The main aim of this paper is to study $n_1 \times n_2 \times n_3$ third-order tensor completion based on…

Let A be a unital separable simple infinite-dimensional nuclear C*-algebra with at least one tracial state. We prove that if the trace space of A has compact finite-dimensional extreme boundary then there exist unital embeddings of matrix…

A consistent Hamiltonian formulation of the teleparallel equivalent of general relativity (TEGR) requires the theory to be invariant under the global SO(3) symmetry group, which acts on orthonormal triads in three-dimensional spacelike…

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…

We show that a tensor product of irreducible, finite dimensional representations of a simple Lie algebra over a field of characteristic zero, determines the individual constituents uniquely. This is analogous to the uniqueness of prime…

In 2011, Kilmer and Martin proposed tensor singular value decomposition (T-SVD) for third order tensors. Since then, T-SVD has applications in low rank tensor approximation, tensor recovery, multi-view clustering, multi-view feature…

We introduce a new criterion which tests if a given decomposition of a given ternary form $T$ of even degree is unique. The criterion is based on the analysis of the Hilbert function of the projective set of points $Z$ associated to the…

We characterise the sensitivity of several additive tensor decompositions with respect to perturbations of the original tensor. These decompositions include canonical polyadic decompositions, block term decompositions, and sums of tree…