Computing the torsion points of a variety defined by lacunary polynomials
Number Theory
2009-11-16 v1 Algebraic Geometry
Abstract
We present an algorithm for computing the set of torsion points satisfying a given system of multivariate polynomial equations. Its complexity is quasilinear in the logarithm of the degree of the input equations and exponential in their number of non zero terms and variables.
Keywords
Cite
@article{arxiv.0911.2594,
title = {Computing the torsion points of a variety defined by lacunary polynomials},
author = {Louis Leroux},
journal= {arXiv preprint arXiv:0911.2594},
year = {2009}
}
Comments
30 pages