Pith. sign in

REVIEW 1 cited by

Completely positive tensor decomposition

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1411.5149 v1 pith:RBOUKWY7 submitted 2014-11-19 math.OC

Completely positive tensor decomposition

Jinyan Fan , Anwa Zhou This is my paper
classification math.OC
keywords completelypositivetensordecompositionsymmetricnonnegativeobtainedalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a symmetric tensor is completely positive. If it is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Entanglement in the Dicke subspace

    quant-ph 2026-02 conditional novelty 7.0

    Mixtures of Dicke states are separable exactly when their parametrizing tensor is completely positive; this yields PPT-entangled examples for all n≥3, d≥3 and SDP relaxations for separability.