Testing degenerate polynomials

DOI10.1007/S00200-011-0150-8zbMATH Open1281.12003OpenAlexW1981339546MaRDI QIDQ429757FDOQ429757

Authors: Mihai Cipu, Ismaïla Diouf, Maurice Mignotte 

Publication date: 20 June 2012

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-011-0150-8

Recommendations

• Counting degenerate polynomials of fixed degree and bounded height
• Computers and the Multiplicity of Polynomial Roots
• scientific article; zbMATH DE number 1254237
• Efficient algorithms for sparse cyclotomic integer zero testing
• On the number of integer polynomials with multiplicatively dependent roots

zbMATH Keywords

root of unitydegenerate polynomialsSkolem-Mahler-Lech theorem

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Robin's criterion for the Riemann hypothesis
• Additive and multiplicative relations connecting conjugate algebraic numbers
• Computing the measure of a polynomial
• Irreducible polynomials with many roots of equal modulus
• Unimodular integer circulants
• Conjugate algebraic numbers on conics
• Deux propriétés décidables des suites récurrentes linéaires
• Irreducible polynomials with many roots of maximal modulus
• Title not available (Why is that?)

Cited In (6)

• Test polynomials
• Title not available (Why is that?)
• The number of roots of a lacunary bivariate polynomial on a line
• Counting degenerate polynomials of fixed degree and bounded height
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Testing Low Degree Trigonometric Polynomials

This page was built for publication: Testing degenerate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429757)