Indiscernible arrays and rational functions with algebraic constraint

arXiv1506.07489MaRDI QIDQ6262995FDOQ6262995

Authors: Elad Levi 

Publication date: 24 June 2015

Abstract: Let $k$ be an algebraically closed field of characteristic zero and $P(x,y)ink[x,y]$ be a polynomial which depends on all its variables. $P$ has an algebraic constraint if the set $(P(a,b),(P(a^{\prime },b^{\prime }),P(a^{\prime },b),P(a,b^{\prime }),|,a,a^{\prime },b,b^{\prime }ink$ 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,Gink[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)cdotG(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.

This page was built for publication: Indiscernible arrays and rational functions with algebraic constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6262995)