On minimal free resolutions of sub-permanents and other ideals arising in complexity theory Academic Article uri icon

abstract

  • 2018 Elsevier Inc. We compute the linear strand of the minimal free resolution of the ideal generated by kk sub-permanents of an nn generic matrix and of the ideal generated by square-free monomials of degree k. The latter calculation gives the full minimal free resolution by [1]. Our motivation is to lay groundwork for the use of commutative algebra in algebraic complexity theory. We also compute several Hilbert functions relevant for complexity theory.

published proceedings

  • Journal of Algebra

author list (cited authors)

  • Efremenko, K., Landsberg, J. M., Schenck, H., & Weyman, J.

citation count

  • 2

complete list of authors

  • Efremenko, Klim||Landsberg, JM||Schenck, Hal||Weyman, Jerzy

publication date

  • June 2018