Seminars
View all Seminars | Download ICal for this eventA linear-time algorithm for Chow decompositions
Series: Bangalore Theory Seminars
Speaker: Benjamin Lovitz, Concordia University
Date/Time: Sep 19 15:00:00
Location: CSA Auditorium, (Room No. 104, Ground Floor)
Abstract:
We propose a linear-time algorithm to compute low-rank Chow decompositions. Our algorithm can decompose concise symmetric 3-tensors in n variables of Chow rank n/3. The algorithm is pencil based, hence it relies on generalized eigenvalue computations. We also develop sub-quadratic time algorithms for higher order Chow decompositions, and Chow decompositions of 3-tensors into products of linear forms which do not lie on the generic orbit. In particular, we obtain a sub-quadratic-time algorithm for decomposing a symmetric 3-tensor into a linear combination of W-tensors. Based on the joint work Link with Alexander Taveira Blomenhofer.
Microsoft teams link:
Teams link
Link
We are grateful to the Kirani family (Link and the Walmart Center for Tech Excellence (Link for generously supporting this seminar series
Hosts: Rameesh Paul, Nirjhar Das, KVN Sreenivas, Rahul Madhavan, Debajyoti Kar