Computing the torsion points of a variety defined by lacunary polynomials

2011/10/21 by Louis Leroux, Louis Patrick Leroux · 1 citation
Computer Science · Mathematics · #Polynomial and algebraic computation #Coding theory and cryptography #Algebraic Geometry and Number Theory

paper · pdf · doi:10.1090/s0025-5718-2011-02548-2

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 and in the height of the input equations but exponential in their number of variables and nonzero terms.

Cited by

• Space vectors forming rational angles

Related

• Computing the torsion points of a variety defined by lacunary polynomials
• Solving algebraic equations in roots of unity
• Torsion Points on an Algebraic Subset of an Affine Torus
• Efficiently Detecting Torsion Points and Subtori
• Counting torsion points on subvarieties of the algebraic torus