A fast algorithm for computing multiplicative relations between the roots of a generic polynomial

DOI10.1016/j.jsc.2020.08.001zbMath1462.11095arXiv1912.07202OpenAlexW3048132303MaRDI QIDQ2229723

Tao Zheng

Publication date: 18 February 2021

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

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

zbMATH Keywords

Galois groupbasispolynomial rootsmultiplicative relationexponent lattice

Mathematics Subject Classification ID

Galois theory (11R32) Number-theoretic algorithms; complexity (11Y16) Polynomials (irreducibility, etc.) (11R09) Computational methods for problems pertaining to field theory (12-08)

Related Items

Order bounds for C2-finite sequences

Uses Software

• Dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing generating sets of lattice ideals and Markov bases of lattices
• The structure of polynomial invariants of linear loops
• Additive and multiplicative relations connecting conjugate algebraic numbers
• The distribution of the Galois groups of integral polynomials
• Polynomial relations between polynomial roots
• Solvability of groups of odd order
• Polynomial invariants for linear loops
• Quantum automata and algebraic groups
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Automorphism groups of designs
• Linear relations between roots of polynomials
• Polynomials with nontrivial relations between their roots
• The inverse of a block-circulant matrix
• An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
• Explicit Galois realization of transitive groups of degree up to 15