求解稀疏列支撑行列式多项式组的同伦技巧
Homotopy techniques for solving sparse column support determinantal polynomial systems
摘要:
设$\mathbf{K}$是一个特征为零的域,其代数闭包为$\overline{\mathbf{K}}$.给定一个多项式序列$\mathbf{g} = (g_1, \ldots, g_s) \in \mathbf{K}[x_1, \ldots , x_n]^s$和一个多项式矩阵$\mathbf{F} = [f_{i,j}] \in \mathbf{K}[x_1, \ldots, x_n]^{p \times q}$,使用$p \leq q$,我们感兴趣的是确定$V_p(\mathbf{F},\mathbf{g})$的孤立点,即在假设$n = q - p + s + 1$下,在$\mathbf{g}$中的所有多项式和$\mathbf{F}$的所有$p$ -子式为零的$\overline{\mathbf{K}}$中的点的代数集。这样的多项式系统出现在各种应用中,包括例如多项式优化和计算几何。我们设计了一个随机稀疏同伦算法来计算$V_p(\mathbf{F},\mathbf{g})$中的孤立点,它利用了定义$V_p(\mathbf{F}, \mathbf{g})$的系统的行列式结构。它的复杂性是多项式的最大数量的孤立的解决方案,这样的系统共享相同的稀疏模式,并在一些组合的数量附加到这样的系统的结构。这是第一个算法,同时利用行列式的结构和输入多项式的稀疏性。我们还推导出复杂性界限的特殊但重要的情况下,$\mathbf{g}$和列的$\mathbf{F}$满足加权度约束。这样的系统自然出现在计算临界点的地图限制到代数集时,都是不变的行动的对称群。
英文摘要:
Let $\mathbf{K}$ be a field of characteristic zero with $\overline{\mathbf{K}}$ its algebraic closure. Given a sequence of polynomials $\mathbf{g} = (g_1, \ldots, g_s) \in \mathbf{K}[x_1, \ldots , x_n]^s$ and a polynomial matrix $\mathbf{F} = [f_{i,j}] \in \mathbf{K}[x_1, \ldots, x_n]^{p \times q}$, with $p \leq q$, we are interested in determining the isolated points of $V_p(\mathbf{F},\mathbf{g})$, the algebraic set of points in $\overline{\mathbf{K}}$ at which all polynomials in $\mathbf{g}$ and all $p$-minors of $\mathbf{F}$ vanish, under the assumption $n = q - p + s + 1$. Such polynomial systems arise in a variety of applications including for example polynomial optimization and computational geometry. We design a randomized sparse homotopy algorithm for computing the isolated points in $V_p(\mathbf{F},\mathbf{g})$ which takes advantage of the determinantal structure of the system defining $V_p(\mathbf{F}, \mathbf{g})$. Its complexity is polynomial in the maximum number of isolated solutions to such systems sharing the same sparsity pattern and in some combinatorial quantities attached to the structure of such systems. It is the first algorithm which takes advantage both on the determinantal structure and sparsity of input polynomials. We also derive complexity bounds for the particular but important case where $\mathbf{g}$ and the columns of $\mathbf{F}$ satisfy weighted degree constraints. Such systems arise naturally in the computation of critical points of maps restricted to algebraic sets when both are invariant by the action of the symmetric group.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。