arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.06489math.AGcs.SCmath.CA
收藏

线性代数群复曲面包络的度界

Degree bound for toric envelope of a linear algebraic group

Eli Amzallag, Andrei Minchenko, Gleb Pogudin

摘要:

使用线性代数群的算法通常通过定义多项式方程来表示它们。人们总是可以为一个代数群选择定义方程,使其次数至多等于该群作为代数簇的次数。然而,即使对于$n = 1$,线性代数群$G \subset \mathrm{GL}_n(C)$的次数也可以任意大。其中一个关键成分Hrushovski的算法计算伽罗瓦群的线性微分方程是一个想法"近似“每一个代数子群的$\mathrm{GL}_n(C)$由一个”类似“组,使后者的程度是有界的一致$n$。使这个统一的界限计算上可行的是至关重要的,使算法实用。在本文中,我们推导出这样的近似(我们称之为复曲面包络),这是定性最优的单指数度界。作为应用,我们将Feng的Hrushovski算法第一步的五重指数界改进为单指数界。对于实践中经常出现的$n = 2, 3$情形,进一步细化了一般界.

英文摘要:

Algorithms working with linear algebraic groups often represent them via defining polynomial equations. One can always choose defining equations for an algebraic group to be of the degree at most the degree of the group as an algebraic variety. However, the degree of a linear algebraic group $G \subset \mathrm{GL}_n(C)$ can be arbitrarily large even for $n = 1$. One of the key ingredients of Hrushovski's algorithm for computing the Galois group of a linear differential equation was an idea to `approximate' every algebraic subgroup of $\mathrm{GL}_n(C)$ by a `similar' group so that the degree of the latter is bounded uniformly in $n$. Making this uniform bound computationally feasible is crucial for making the algorithm practical. In this paper, we derive a single-exponential degree bound for such an approximation (we call it toric envelope), which is qualitatively optimal. As an application, we improve the quintuply exponential bound for the first step of the Hrushovski's algorithm due to Feng to a single-exponential bound. For the cases $n = 2, 3$ often arising in practice, we further refine our general bound.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑