Permanent versus determinant: not via saturations. Bürgisser, P., Ikenmeyer, C., & Hüttenhain, J. 07 2015. To appear in Proc. AMSPaper abstract bibtex Let $Det_n$ denote the closure of the $\mathrm G\mathrm L(n^2,\mathbb C)$-orbit of the determinant polynomial $\det_n$ with respect to linear substitution. The highest weights (partitions) of irreducible $\mathrm G\mathrm L(n^2,\mathbb C)$-representations occurring in the coordinate ring of $Det_n$ form a finitely generated monoid $S(Det_n)$. We prove that the saturation of $S(Det_n)$ contains all partitions $\lambda$ with length at most $n$ and size divisible by $n$. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid $S(Det_n)$.
@UNPUBLISHED{BIH-Permanent-Versus-Determinant-Not-Via-Saturations,
TITLE={Permanent versus determinant: not via saturations},
URL={http://arxiv.org/abs/1501.05528},
NOTE={To appear in Proc. AMS},
AUTHOR={Peter Bürgisser and Christian Ikenmeyer and Jesko Hüttenhain},
YEAR={2015},
ABSTRACT={Let $Det_n$ denote the closure of the $\mathrm G\mathrm L(n^2,\mathbb C)$-orbit of the determinant polynomial $\det_n$ with respect to linear substitution. The highest weights (partitions) of irreducible $\mathrm G\mathrm L(n^2,\mathbb C)$-representations occurring in the coordinate ring of $Det_n$ form a finitely generated monoid $S(Det_n)$. We prove that the saturation of $S(Det_n)$ contains all partitions $\lambda$ with length at most $n$ and size divisible by $n$. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid $S(Det_n)$.},
MONTH={07}
}
Downloads: 0
{"_id":"pKLmyb3fZFgRY2JiS","bibbaseid":"brgisser-ikenmeyer-httenhain-permanentversusdeterminantnotviasaturations-2015","downloads":0,"creationDate":"2017-01-04T12:11:10.499Z","title":"Permanent versus determinant: not via saturations","author_short":["Bürgisser, P.","Ikenmeyer, C.","Hüttenhain, J."],"year":2015,"bibtype":"unpublished","biburl":"http://www3.math.tu-berlin.de/algebra/static/papers.parsed.bib","bibdata":{"bibtype":"unpublished","type":"unpublished","title":"Permanent versus determinant: not via saturations","url":"http://arxiv.org/abs/1501.05528","note":"To appear in Proc. AMS","author":[{"firstnames":["Peter"],"propositions":[],"lastnames":["Bürgisser"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Ikenmeyer"],"suffixes":[]},{"firstnames":["Jesko"],"propositions":[],"lastnames":["Hüttenhain"],"suffixes":[]}],"year":"2015","abstract":"Let $Det_n$ denote the closure of the $\\mathrm G\\mathrm L(n^2,\\mathbb C)$-orbit of the determinant polynomial $\\det_n$ with respect to linear substitution. The highest weights (partitions) of irreducible $\\mathrm G\\mathrm L(n^2,\\mathbb C)$-representations occurring in the coordinate ring of $Det_n$ form a finitely generated monoid $S(Det_n)$. We prove that the saturation of $S(Det_n)$ contains all partitions $\\lambda$ with length at most $n$ and size divisible by $n$. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid $S(Det_n)$.","month":"07","bibtex":"@UNPUBLISHED{BIH-Permanent-Versus-Determinant-Not-Via-Saturations,\r\n TITLE={Permanent versus determinant: not via saturations},\r\n URL={http://arxiv.org/abs/1501.05528},\r\n NOTE={To appear in Proc. AMS},\r\n AUTHOR={Peter Bürgisser and Christian Ikenmeyer and Jesko Hüttenhain},\r\n YEAR={2015},\r\n ABSTRACT={Let $Det_n$ denote the closure of the $\\mathrm G\\mathrm L(n^2,\\mathbb C)$-orbit of the determinant polynomial $\\det_n$ with respect to linear substitution. The highest weights (partitions) of irreducible $\\mathrm G\\mathrm L(n^2,\\mathbb C)$-representations occurring in the coordinate ring of $Det_n$ form a finitely generated monoid $S(Det_n)$. We prove that the saturation of $S(Det_n)$ contains all partitions $\\lambda$ with length at most $n$ and size divisible by $n$. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid $S(Det_n)$.},\r\n MONTH={07}\r\n}\r\n\r\n","author_short":["Bürgisser, P.","Ikenmeyer, C.","Hüttenhain, J."],"key":"BIH-Permanent-Versus-Determinant-Not-Via-Saturations","id":"BIH-Permanent-Versus-Determinant-Not-Via-Saturations","bibbaseid":"brgisser-ikenmeyer-httenhain-permanentversusdeterminantnotviasaturations-2015","role":"author","urls":{"Paper":"http://arxiv.org/abs/1501.05528"},"downloads":0,"html":""},"search_terms":["permanent","versus","determinant","via","saturations","bürgisser","ikenmeyer","hüttenhain"],"keywords":[],"authorIDs":[],"dataSources":["mFLw2PzriqAWWFuqX"]}