arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.00470math.AG
收藏

Laurent多项式展开系的结式

The Resultant of Developed Systems of Laurent Polynomials

Askold Khovanskii, Leonid Monin

摘要:

令$R_Δ(f_1,\ldots,f_{n+1})$为劳伦多项式的$(n+1)$元组的{ \it $Δ$ -结式}(见下文)。我们提供了一个计算$R_Δ$的算法,假设$n$元组$(f_2,\dots,f_{n+1})$是{ \it开发}(见第6节)。假设$n$元组$(f_1f_2,f_3,\ldots,f_{n+1})$被开发,我们提供了$(\mathbb C^*)^n$中$f_1$在$f_2=\dots=f_{n+1}=0$的根上的乘积和$(\mathbb C^*)^n$中$f_2$在$f_1=f_3=\dots=f_{n+1}=0$的根上的乘积之间的关系.如果所有包含在$(f_1,\dots,f_{n+1})$中的$n$ -元组都被开发出来,我们就为$R_Δ$提供了一个有符号的泊松公式。在我们的证明中,我们使用的拓扑参数和拓扑版本的Parshin互易定律。

英文摘要:

Let $R_Δ(f_1,\ldots,f_{n+1})$ be the {\it $Δ$-resultant} (see below) of $(n+1)$-tuple of Laurent polynomials. We provide an algorithm for computing $R_Δ$ assuming that an $n$-tuple $(f_2,\dots,f_{n+1})$ is {\it developed} (see sec.6). We provide a relation between the product of $f_1$ over roots of $f_2=\dots=f_{n+1}=0$ in $(\mathbb C^*)^n$ and the product of $f_2$ over roots of $f_1=f_3=\dots=f_{n+1}=0$ in $(\mathbb C^*)^n$ assuming that the $n$-tuple $(f_1f_2,f_3,\ldots,f_{n+1})$ is developed. If all $n$-tuples contained in $(f_1,\dots,f_{n+1})$ are developed we provide a signed version of Poisson formula for $R_Δ$. In our proofs we use a topological arguments and topological version of the Parshin reciprocity laws.

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

↑