We study root separation of reducible monic integer polynomials of odd degree. Let H(P) be the naïve height, sep(P) the minimal distance between two distinct roots of an integer polynomial P(x) and sep(P) = H(P)^(-e(P)). Let e_r*(d) = lim sup_{deg(P)=d, H(P)→+∞} e(P), where the lim sup is taken over the reducible monic integer polynomials P(x) of degree d. We prove that e_r*(d) ≤ d - 2. We also obtain a lower bound for e_r*(d) for d odd, which improves previously known lower bounds for e_r*(d) when d ∈ {5, 7, 9}
Agrawal, Kayal, and Saxena recently introduced a new method of proving that an integer is prime. The...
International audienceThe absolute separation of a polynomial is the minimum nonzero difference betw...
AbstractWe give a lower bound for the minimum distance between two zeros of a polynomial systemfin t...
We study root separation of reducible monic integer polynomials of odd degree. Let H(P) be the naïve...
We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The q...
AbstractIn vol. 32 of this Journal, G.E. Collins reported on extensive calculations supporting his c...
Best paper awardInternational audienceIn this paper we derive aggregate separation bounds, named aft...
The minimum root separation of an arbitrary polynomial P is defined as the minimum of the distances ...
AbstractA lower bound for the number of integer polynomials which simultaneously have “close” comple...
Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of prime...
AbstractWe study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Štefankovič...
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (DMM), on...
We study bounds on the distances of roots of integer polynomials and applications of such results. T...
International audienceWe rely on aggregate separation bounds for univariate polynomials to introduce...
We solve a Lehmer-type question about the Mahler measure of integer-valued polynomials.Comment: 9 pa...
Agrawal, Kayal, and Saxena recently introduced a new method of proving that an integer is prime. The...
International audienceThe absolute separation of a polynomial is the minimum nonzero difference betw...
AbstractWe give a lower bound for the minimum distance between two zeros of a polynomial systemfin t...
We study root separation of reducible monic integer polynomials of odd degree. Let H(P) be the naïve...
We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The q...
AbstractIn vol. 32 of this Journal, G.E. Collins reported on extensive calculations supporting his c...
Best paper awardInternational audienceIn this paper we derive aggregate separation bounds, named aft...
The minimum root separation of an arbitrary polynomial P is defined as the minimum of the distances ...
AbstractA lower bound for the number of integer polynomials which simultaneously have “close” comple...
Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of prime...
AbstractWe study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Štefankovič...
In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (DMM), on...
We study bounds on the distances of roots of integer polynomials and applications of such results. T...
International audienceWe rely on aggregate separation bounds for univariate polynomials to introduce...
We solve a Lehmer-type question about the Mahler measure of integer-valued polynomials.Comment: 9 pa...
Agrawal, Kayal, and Saxena recently introduced a new method of proving that an integer is prime. The...
International audienceThe absolute separation of a polynomial is the minimum nonzero difference betw...
AbstractWe give a lower bound for the minimum distance between two zeros of a polynomial systemfin t...