Sets computing the symmetric tensor rank

Details Sets computing the symmetric tensor rank Sets computing the symmetric tensor rank

2012-02-14

arxiv.org/abs/1202.3066v1

Mathematics

Algebraic Geometry

Scientific paper

Let n_d denote the degree d Veronese embedding of a projective space P^r. For any symmetric tensor P, the 'symmetric tensor rank' sr(P) is the minimal cardinality of a subset A of P^r, such that n_d(A) spans P. Let S(P) be the space of all subsets A of P^r, such that n_d(A) computes sr(P). Here we classify all P in P^n such that sr(P) < 3d/2 and sr(P) is computed by at least two subsets. For such tensors P, we prove that S(P) has no isolated points.

Affiliated with

Also associated with

No associations

Rating

Sets computing the symmetric tensor rank does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sets computing the symmetric tensor rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sets computing the symmetric tensor rank will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89915