An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers

DOI10.1145/3326229.3326243zbMath1462.11113arXiv1808.02712OpenAlexW2912185594WikidataQ130967869 ScholiaQ130967869MaRDI QIDQ5121132

Tao Zheng, Bican Xia

Publication date: 10 September 2020

Published in: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

Diophantine equationalgebraic numbersmultiplicative dependencemultiplicative relationexponent lattice basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (3)

Order bounds for C2-finite sequences ⋮ Computing the binomial part of a polynomial ideal ⋮ A fast algorithm for computing multiplicative relations between the roots of a generic polynomial

This page was built for publication: An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers