关于广义MinRank问题的复杂性
On the Complexity of the Generalized MinRank Problem
摘要:
我们研究了求解\emph{generalized MinRank problem}的复杂性,即计算多项式矩阵的评价最多具有$r$秩的点的集合。这个问题的一个自然的代数表示产生了一个\emph{determinantal ideal}:由矩阵的所有大小为$r+1$的子式生成的理想。我们给出了新的复杂性界解决这个问题,使用格罗布纳基算法的输入矩阵的一般性假设下。特别是,这些复杂性的界限,使我们能够确定家庭的广义MinRank问题的解决过程中的算术复杂性是多项式的解决方案的数量。我们还提供了一个算法来计算一个合理的参数化的各种0维和自由基系统的二度$(D,1)$。我们证明了它的复杂性可以通过使用广义MinRank问题的复杂性界来定界。
英文摘要:
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a \emph{determinantal ideal}: the ideal generated by all minors of size $r+1$ of the matrix. We give new complexity bounds for solving this problem using Gröbner bases algorithms under genericity assumptions on the input matrix. In particular, these complexity bounds allow us to identify families of generalized MinRank problems for which the arithmetic complexity of the solving process is polynomial in the number of solutions. We also provide an algorithm to compute a rational parametrization of the variety of a 0-dimensional and radical system of bi-degree $(D,1)$. We show that its complexity can be bounded by using the complexity bounds for the generalized MinRank problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。