For more information about this meeting, contact Jason Morton.
|Title:||Eigenvectors of tensors and Waring decomposition|
|Seminar:||Applied Algebra and Network Theory Seminar|
|Speaker:||Luke Oeding, U.C. Berkeley|
|Waring’s problem for polynomials is to write a given polynomial as a minimal sum of powers of linear forms. The minimal number of summands required in a Waring decomposition (the Waring rank) is related to secant varieties. I will explain recent work of Landsberg and Ottaviani that unified and generalized many constructions for equations of secant varieties via vector bundle techniques. With Ottaviani we have turned this construction into effective algorithms to actually find the Waring decomposition of a polynomial (provided the Waring rank is below a certain bound). Our algorithms generalize Sylvester’s algorithm for binary forms, using an essential new ingredient – eigenvectors of tensors. Of course a naive algorithm always exists, but is rarely effective. I will explain how computations using linear algebra make our algorithms effective. Given time, I will demonstrate our Macaulay2 implementations.|
Room Reservation Information
|Date:||01 / 16 / 2013|
|Time:||04:40pm - 05:30pm|