Se p 20 06 Efficiently Detecting Embedded Subtori and Algebraic Torsion Points

@inproceedings{Rojas2008SeP2,
  title={Se p 20 06 Efficiently Detecting Embedded Subtori and Algebraic Torsion Points},
  author={J. Maurice Rojas},
  year={2008}
}
Suppose X is the complex zero set of a finite collection of polynomials in Z[x1, ..., xn]. We show that deciding whether X contains a point all of whose coordinates are d roots of unity can be done within NP (relative to the sparse encoding), under a plausible assumption on primes in arithmetic progression. In particular, our hypothesis can still hold even under certain failures of the Generalized Riemann Hypothesis, such as the presence of Siegel-Landau zeroes. Furthermore, our complexity… CONTINUE READING