Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Geometric lower bounds for generalized ranks (1406.5145v2)

Published 19 Jun 2014 in math.AG and cs.CC

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

We haven't generated a summary for this paper yet.