Pith. sign in

REVIEW 1 cited by

Border rank is not multiplicative under the tensor product

Not yet reviewed by Pith; the record is open.

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 1801.04852 v2 pith:6QFODZWZ submitted 2018-01-15 math.AG quant-ph

classification math.AGquant-ph
keywords ranktensorborderproductcactusorderstrictlysubmultiplicative
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It has recently been shown that the tensor rank can be strictly submultiplicative under the tensor product, where the tensor product of two tensors is a tensor whose order is the sum of the orders of the two factors. The necessary upper bounds were obtained with help of border rank. It was left open whether border rank itself can be strictly submultiplicative. We answer this question in the affirmative. In order to do so, we construct lines in projective space along which the border rank drops multiple times and use this result in conjunction with a previous construction for a tensor rank drop. Our results also imply strict submultiplicativity for cactus rank and border cactus rank.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Asymptotic tensor rank is characterized by polynomials

    cs.CC 2024-11 conditional novelty 8.0 of 10

    Sublevel sets of asymptotic tensor rank are Zariski-closed, making the parameter well-ordered in value, complete over the complex numbers, and computable from above.

Pith tools