On the Davenport-Mahler bound

2016/06/21 by Paula Escorcielo, Escorcielo, Paula, Daniel Perrucci +1 · 1 citation
Engineering · Mathematics · #12D10 #13P15 #Advanced Combinatorial Mathematics #Algebraic Geometry (math.AG) #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics #Mathematics and Applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1606.06572

openalex publication_date 2016/06/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove that the Davenport-Mahler bound holds for arbitrary graphs with vertices on the set of roots of a given univariate polynomial with complex coefficients.

Cited by

• Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms

Related

• Generalizing The Davenport-Mahler-Mignotte Bound -- The Weighted Case
• Spanning Trees and Mahler Measure
• Upper Bounds on Polynomial Root Separation
• The alternative to Mahler measure of a multivariate polynomial
• Mahler measure of P_d polynomials