MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

We are given an affine variety $V\subset \mathbb{A}^n\times\mathbb{A}^n$, and wish to know if it contains a product of the form $C_1\times C_2$, where $C_1$ and $C_2$ are two curves in $\mathbb{A}^n$. First, is there an algorithm to decide this? Second, is it true that if $V$ is of degree $d$ and does contain a product of the form $C_1\times C_2$, then $V$ contains a product of the form $C_1\times C_2$ with $\deg C_1,\deg C_2\leq f(d,n)$, for some function $f$?

share|cite|improve this question
up vote 4 down vote accepted

Yes, there is such an algorithm. There is an effectively computable constant $N$ such that if $V$ contains a product $S\times T$ where $S,T$ are $N$-point sets, then $V$ contains product of two curves. It is actually true even in the semialgebraic setting. The result is Theorem 1.9 from

[ Apologies for answering my own question with a reference to my own paper. When I asked the question, I did not know the answer. ]

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.