An implicitization challenge for binary factor analysis
Journal of Symbolic Computation
Geometric complexity theory and tensor rank
Proceedings of the forty-third annual ACM symposium on Theory of computing
Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
Journal of Symbolic Computation
General tensor decomposition, moment matrices and applications
Journal of Symbolic Computation
Hi-index | 0.00 |
We establish basic techniques for determining the ideals of secant varieties of Segre varieties.We solve a conjecture of Garcia, Stillman, and Sturmfels on the generators of the ideal of the first secant variety in the case of three factors and solve the conjecture set-theoretically for an arbitrary number of factors. We determine the low degree components of the ideals of secant varieties of small dimension in a few cases.