Computing the torsion points of a variety defined by lacunary polynomials

DOI10.1090/S0025-5718-2011-02548-2zbMath1263.11115arXiv0911.2594OpenAlexW2056622035MaRDI QIDQ2894522

Louis Leroux

Publication date: 29 June 2012

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.2594

zbMATH Keywords

algorithmroots of unitytorsion pointsalgebraic torus

Mathematics Subject Classification ID

Related Items (5)

Cyclotomic Points and Algebraic Properties of Polygon Diagonals ⋮ Groups generated by iterations of polynomials over finite fields ⋮ The number of maximal torsion cosets in subvarieties of tori ⋮ Overdetermined systems of sparse polynomial equations ⋮ Elements of large order on varieties over prime finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small points on rational subvarieties of tori
• New NP-hard and NP-complete polynomial and integer divisibility problems
• Efficient algorithms for sparse cyclotomic integer zero testing
• Fast multiplication of large numbers
• Approximate formulas for some functions of prime numbers
• Solving algebraic equations in roots of unity
• Irreducibility and greatest common divisor algorithms for sparse polynomials
• Lecture Notes on Diophantine Analysis
• Solving algebraic equations in roots of unity.
• Trigonometric diophantine equations (On vanishing sums of roots of unity)
• The Number of Intersection Points Made by the Diagonals of a Regular Polygon
• On testing the divisibility of lacunary polynomials by cyclotomic polynomials
• Minorations des hauteurs normalisees des sous-varietes des puissances des courbes elliptiques
• Points de petite hauteur sur une sous-variété d'un tore
• Exponential diophantine equations

This page was built for publication: Computing the torsion points of a variety defined by lacunary polynomials