On minimal free resolutions of sub-permanents and other ideals arising in complexity theory (Q1643083)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On minimal free resolutions of sub-permanents and other ideals arising in complexity theory |
scientific article |
Statements
On minimal free resolutions of sub-permanents and other ideals arising in complexity theory (English)
0 references
18 June 2018
0 references
Let us consider the polynomial ring \(R=\mathbb{C}[x_1,\ldots ,x_n]\). Given an integer \(k\), let \(I_k \subset R\) be the ideal generated by square-free monomials of degree \(k\). In addition, let \(S=\mathbb{C}[x_{i,j}]_{1\leq i,j\leq n}\) and \(J_k\) be the ideal generated by \(k\times k\) sub-permanents of an \(n \times n\) generic matrix. Recall that the permanent polynomial of an \(m\times m\) matrix \(Y=[y_{i,j}]_{1\leq i,j\leq m}\) is defined to be \(\text{perm}_m(Y)=\sum_{\sigma\in \mathcal{C}_m}{y_{1,\sigma(1)} \cdots y_{m,\sigma (m)}}\) where \(\mathcal{C}_m\) is the symmetric group on \(m\) elements. In the paper under review, the authors compute the linear strand of the minimal free resolution of \(I_k\) and \(J_k\). Motivated by the complexity theory, the authors seek to find differences between the homological behavior of these ideals.
0 references
computational complexity
0 references
free resolution
0 references
determinant
0 references
permanent
0 references
0 references