Papers
Topics
Authors
Recent
Search
2000 character limit reached

Geometric lower bounds for generalized ranks

Published 19 Jun 2014 in math.AG and cs.CC | (1406.5145v2)

Abstract: We revisit a geometric lower bound for Waring rank of polynomials (symmetric rank of symmetric tensors) of Landsberg and Teitler and generalize it to a lower bound for rank with respect to arbitrary varieties, improving the bound given by the "non-Abelian" catalecticants recently introduced by Landsberg and Ottaviani. This is applied to give lower bounds for ranks of multihomogeneous polynomials (partially symmetric tensors); a special case is the simultaneous Waring decomposition problem for a linear system of polynomials. We generalize the classical Apolarity Lemma to multihomogeneous polynomials and give some more general statements. Finally we revisit the lower bound of Ranestad and Schreyer, and again generalize it to multihomogeneous polynomials and some more general settings.

Citations (33)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.