Koszul-Young flattenings and symmetric border rank of the determinant

详细信息    查看全文

• 作者：Cameron Farnsworth ^{cfarnsworth@math.tamu.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Computational complexity ; Determinant ; Permanent
• 刊名：Journal of Algebra
• 出版年：2016
• 出版时间：1 February 2016
• 年：2016
• 卷：447
• 期：Complete
• 页码：664-676
• 全文大小：293 K

文摘

We present new lower bounds for the symmetric border rank of the class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0021869315005712&_mathId=si1.gif&_user=111111111&_pii=S0021869315005712&_rdoc=1&_issn=00218693&md5=cbe5de8a5839b1e21c194b7fc402bf1c" title="Click to view the MathML source">n×nclass="mathContainer hidden">class="mathCode">$n\times n$ determinant for all n  . Further lower bounds are given for the class="mathmlsrc">class="formulatext stixSupport mathImg" data-mathURL="/science?_ob=MathURL&_method=retrieve&_eid=1-s2.0-S0021869315005712&_mathId=si2.gif&_user=111111111&_pii=S0021869315005712&_rdoc=1&_issn=00218693&md5=c7b3b1f803282e316f0e7555326325c3" title="Click to view the MathML source">3×3class="mathContainer hidden">class="mathCode">$3\times 3$ permanent.