Generalizing The Davenport-Mahler-Mignotte Bound – The Weighted Case

by   Vikram Sharma, et al.

Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the Davenport-Mahler-Mignotte (DMM) bound. One way to state the bound is to consider a directed acyclic graph (V,E) on a subset of roots of a degree d polynomial f(z) ∈ℂ[z], where the edges point from a root of smaller absolute value to one of larger absolute, and the in-degrees of all vertices is at most one. Then the DMM bound is an amortized lower bound on the following product: ∏_(α,β) ∈ E|α-β|. However, the lower bound involves the discriminant of the polynomial f, and becomes trivial if the polynomial is not square-free. This was resolved by Eigenwillig, (2008), by using a suitable subdiscriminant instead of the discriminant. Escorcielo-Perrucci, 2016, further dropped the in-degree constraint on the graph by using the theory of finite differences. Emiris et al., 2019, have generalized their result to handle the case where the exponent of the term |α-β| in the product is at most the multiplicity of either of the roots. In this paper, we generalize these results by allowing arbitrary positive integer weights on the edges of the graph, i.e., for a weight function w: E →ℤ_>0, we derive an amortized lower bound on ∏_(α,β) ∈ E|α-β|^w(α,β). Such a product occurs in the complexity estimates of some recent algorithms for root clustering (e.g., Becker et al., 2016), where the weights are usually some function of the multiplicity of the roots. Because of its amortized nature, our bound is arguably better than the bounds obtained by manipulating existing results to accommodate the weights.


page 1

page 2

page 3

page 4


Several Separations Based on a Partial Boolean Function

We show a partial Boolean function f together with an input x∈ f^-1(*) s...

The D-plus Discriminant and Complexity of Root Clustering

Let p(x) be an integer polynomial with m≥ 2 distinct roots ρ_1,…,ρ_m who...

Graphs with minimum degree-based entropy

The degree-based entropy of a graph is defined as the Shannon entropy ba...

Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases

We consider the graph k-colouring problem encoded as a set of polynomial...

On the Hardness of PosSLP

The problem PosSLP involves determining whether an integer computed by a...

Root Separation for Trinomials

We give a separation bound for the complex roots of a trinomial f ∈Z[X]....

Raz-McKenzie simulation: new gadget and unimprovability of Thickness Lemma

Assume that we have an outer function f:{0, 1}^n →{0, 1} and a gadget fu...

Please sign up or login with your details

Forgot password? Click here to reset