arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.07489math.LOmath.AG
收藏

不可分辨数组与代数约束下的有理函数

Indiscernible arrays and rational functions with algebraic constraint

Elad Levi

摘要:

设$k$是特征为零的代数闭域,$P(x,y)\in k[x,y]$是依赖于其所有变量的多项式.如果集合$\{(P(a,b),(P(a',b'),P(a',b),P(a,b')\,|\,a,a',b,b'\in k\}$不具有最大Zebraki维数,则$P$具有代数约束。陶证明,如果$P$有一个代数约束,那么它可以被分解:存在$Q,F,G\in k[x]$,使$P(x_{1},x_{2})=Q(F(x_{1})+G(x_{2}))$,或$P(x_{1},x_{2})=Q(F(x_{1})\cdot G(x_{2}))$。在本文中,我们给Hrushovski和Zilber提出的一个问题,关于稳定理论中的三维不可分辨阵列的答案。作为这个结果的一个应用,我们找到了具有代数约束的三元有理函数的一个分解。

英文摘要:

Let $k$ be an algebraically closed field of characteristic zero and $P(x,y)\in k[x,y]$ be a polynomial which depends on all its variables. $P$ has an algebraic constraint if the set $\{(P(a,b),(P(a',b'),P(a',b),P(a,b')\,|\,a,a',b,b'\in k\}$ does not have the maximal Zariski-dimension. Tao proved that if $P$ has an algebraic constraint then it can be decomposed: there exists $Q,F,G\in k[x]$ such that $P(x_{1},x_{2})=Q(F(x_{1})+G(x_{2}))$, or $P(x_{1},x_{2})=Q(F(x_{1})\cdot G(x_{2}))$. In this paper we give an answer to a question raised by Hrushovski and Zilber regarding 3-dimensional indiscernible arrays in stable theories. As an application of this result we find a decomposition of rational functions in three variables which has an algebraic constraint.

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

↑