统一的行列式表示
Uniform determinantal representations
AI总结:
本文研究了如何将特定多项式表示为由仿射线性形式组成的方阵的行列式,并提出了统一的行列式表示概念,适用于给定变量数和最大次数的所有多项式。研究得出了矩阵大小的下界,并提出了达到该下界(常数因子范围内)的构造方法,改进了最近的构造方法,并探讨了新表示在双变量系统求根技术中的性能。
摘要:
将特定多项式表示为由仿射线性形式组成的方阵的行列式的问题起源于代数几何、优化、复杂性理论和科学计算。受最近在该领域的发展启发,我们引入了统一的行列式表示的概念,而非单个多项式,而是给定变量数和最大次数的所有多项式。我们得出了矩阵大小的下界,并提出了一种构造方法,该方法在变量数固定且次数增加时,达到该下界(常数因子范围内)。该构造方法改进了最近由Plestenjak-Hochstenbach提出的构造方法,并探讨了新表示在双变量系统求根技术中的性能。此外,我们将统一的行列式表示与奇异矩阵的向量空间联系起来,并最后提出了一些未来的研究方向。
英文摘要:
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this last area, we introduce the notion of a uniform determinantal representation, not of a single polynomial but rather of all polynomials in a given number of variables and of a given maximal degree. We derive a lower bound on the size of the matrix, and present a construction achieving that lower bound up to a constant factor as the number of variables is fixed and the degree grows. This construction marks an improvement upon a recent construction due to Plestenjak-Hochstenbach, and we investigate the performance of new representations in their root-finding technique for bivariate systems. Furthermore, we relate uniform determinantal representations to vector spaces of singular matrices, and we conclude with a number of future research directions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。