稀疏格罗布纳基:非混合情形
Sparse Gröbner Bases: the Unmixed Case
摘要:
复曲面(或稀疏)消去理论是在过去几十年中开发的一个框架,用于利用洛朗多项式系统中的单项式结构。粗略地说,这相当于在一个\emph{semigroup algebra}中计算,\emph{i.e.}是由洛朗单项式的子集生成的代数。为了解决符号稀疏系统,我们引入\emph{sparse Gröbner bases},一个模拟的经典格罗布纳基的半群代数,我们提出了稀疏的$F_5$和FGLM算法的变种来计算它们。我们的原型“概念验证”实现显示了大的速度提升(超过100的一些例子)相比,优化(经典)格罗布纳基的软件。此外,在生成的单项式的子集对应于一个正常的格多面体$\mathcal P\subset\mathbb R^n$中的整数坐标的点的情况下,并在正则性假设下,我们证明了复杂性界依赖于组合性质的$\mathcal P$。这些界限产生新的估计的复杂性解决$0$ -dim系统,其中所有的多项式共享相同的牛顿多面体(\emph{unmixed case})。例如,我们推广的约束$\min(n_1,n_2)+1$的最大程度上在一个$0$ -dim.双线性系统的Gröbner基础上的块的大小$(n_1,n_2)$的多线性的情况下:$\sum n_i - \max(n_i)+1$的变量。我们还提出了一个变体的Fröberg猜想,使我们能够估计的复杂性,解决超定稀疏系统。
英文摘要:
Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.} an algebra generated by a subset of Laurent monomials. In order to solve symbolically sparse systems, we introduce \emph{sparse Gröbner bases}, an analog of classical Gröbner bases for semigroup algebras, and we propose sparse variants of the $F_5$ and FGLM algorithms to compute them. Our prototype "proof-of-concept" implementation shows large speed-ups (more than 100 for some examples) compared to optimized (classical) Gröbner bases software. Moreover, in the case where the generating subset of monomials corresponds to the points with integer coordinates in a normal lattice polytope $\mathcal P\subset\mathbb R^n$ and under regularity assumptions, we prove complexity bounds which depend on the combinatorial properties of $\mathcal P$. These bounds yield new estimates on the complexity of solving $0$-dim systems where all polynomials share the same Newton polytope (\emph{unmixed case}). For instance, we generalize the bound $\min(n_1,n_2)+1$ on the maximal degree in a Gröbner basis of a $0$-dim. bilinear system with blocks of variables of sizes $(n_1,n_2)$ to the multilinear case: $\sum n_i - \max(n_i)+1$. We also propose a variant of Fröberg's conjecture which allows us to estimate the complexity of solving overdetermined sparse systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。