On minimal free resolutions and the method of shifted partial derivatives in complexity theory.
CoRR(2015)
摘要
The minimal free resolution of the Jacobian ideals of the determinant polynomial were computed by Lascoux, and it is an active area of research to understand the Jacobian ideals of the permanent. As a step in this direction we compute several new cases and completely determine the linear strands of the minimal free resolutions of the ideals generated by sub-permanents. Our motivation is an exploration of the utility and limits of the method of shifted partial derivatives introduced by Kayal and Gupta-Kamath-Kayal-Saptharishi. The method of shifted partial derivatives amounts to computing Hilbert functions of Jacobian ideals, and the Hilbert functions are in turn the Euler characteristics of the minimal free resolutions of the Jacobian ideals. We compute several such Hilbert functions relevant for complexity theory. We show that the method of shifted partial derivatives alone cannot prove the size m padded permanent cannotbe realized inside the orbit closure of the size n determinant when m< 1.5n^2.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络