2000 character limit reached
Flattenings and Koszul Young flattenings arising in complexity theory
Published 3 Oct 2015 in math.AG and cs.CC | (1510.00886v2)
Abstract: I find new equations for Chow varieties, their secant varieties, and an additional variety that arises in the study of depth 5 circuits by flattenings and Koszul Young flattenings. This enables a new lower bound for symmetric border rank of $x_1x_2\cdots x_d$ when $d$ is odd, and a lower bound on the size of depth 5 circuits that compute the permanent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.