Singular tuples of matrices is not a null cone (and the symmetries of algebraic varieties)

Author:

Makam Visu1,Wigderson Avi2

Affiliation:

1. School of Mathematics and Statistics , University of Melbourne , Melbourne , Australia

2. School of Mathematics , Institute for Advanced Study , Princeton , USA

Abstract

Abstract The following multi-determinantal algebraic variety plays a central role in algebra, algebraic geometry and computational complexity theory: SING n , m {{\rm SING}_{n,m}} , consisting of all m-tuples of n × n {n\times n} complex matrices which span only singular matrices. In particular, an efficient deterministic algorithm testing membership in SING n , m {{\rm SING}_{n,m}} will imply super-polynomial circuit lower bounds, a holy grail of the theory of computation. A sequence of recent works suggests such efficient algorithms for memberships in a general class of algebraic varieties, namely the null cones of linear group actions. Can this be used for the problem above? Our main result is negative: SING n , m {{\rm SING}_{n,m}} is not the null cone of any (reductive) group action! This stands in stark contrast to a non-commutative analog of this variety, and points to an inherent structural difficulty of SING n , m {{\rm SING}_{n,m}} . To prove this result, we identify precisely the group of symmetries of SING n , m {{\rm SING}_{n,m}} . We find this characterization, and the tools we introduce to prove it, of independent interest. Our work significantly generalizes a result of Frobenius for the special case m = 1 {m=1} , and suggests a general method for determining the symmetries of algebraic varieties.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,General Mathematics

Reference53 articles.

1. Z. Allen-Zhu, A. Garg, Y. Li, R. Oliveira and A. Wigderson, Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing, STOC’18—Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York (2018), 172–181.

2. S. A. Amitsur, Rational identities and applications to algebra and geometry, J. Algebra 3 (1966), 304–359.83]

3. P. Bürgisser, C. Franks, A. Garg, R. Oliveira, M. Walter and A. Wigderson, Efficient algorithms for tensor scaling, quantum marginals, and moment polytopes, 59th Annual IEEE Symposium on Foundations of Computer Science—FOCS 2018, IEEE Computer Society, Los Alamitos (2018), 883–897.

4. P. Bürgisser, A. Garg, R. Oliveira, M. Walter and A. Wigderson, Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory, 9th Innovations in Theoretical Computer Science, LIPIcs. Leibniz Int. Proc. Inform. 94, Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Wadern (2018), Article No. 24.

5. P. Bürgisser, M. Levent Doğan, V. Makam, M. Walter and A. Wigderson, Polynomial time algorithms in invariant theory for torus actions, preprint (2021), https://arxiv.org/abs/2102.07727.

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Connections between graphs and matrix spaces;Israel Journal of Mathematics;2023-09

2. Polystability in positive characteristic and degree lower bounds for invariant rings;Journal of Combinatorial Algebra;2022-11-09

3. Non-commutative Optimization - Where Algebra, Analysis and Computational Complexity Meet;Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation;2022-07-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3