Counting and testing dominant polynomials

DOI10.1080/10586458.2014.992080MaRDI QIDQ2813821zbMATH OpenOpenAlexFDO

Authors Min Sha, A. Dubickas

Publication date 27 June 2016

Published in Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Bistritz stability criteriondominant polynomiallinear recurrence sequenceSturm's theorem

Mathematics Subject Classification ID

Recurrences (11B37) Polynomials in number theory (11C08) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06)

Abstract: In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In particular, our results imply that the probability that the dominant root assumption holds for a random monic polynomial with integer coefficients tends to 1 in some setting. However, for arbitrary integer polynomials it does not tend to 1. For instance, the proportion of dominant quadratic integer polynomials of height $H$ among all quadratic integer polynomials tends to $(41+6log2)/72$ as $Hoinfty$. Finally, we will design some algorithms to test whether a given polynomial with integer coefficients is dominant or not without finding the polynomial roots.

Recommendations

• Roots of polynomials with dominant term
• Computation of dominant real roots of polynomials
• Counting degenerate polynomials of fixed degree and bounded height
• Randomized polynomial-time root counting in prime power rings
• Double roots of random polynomials with integer coefficients

Cites work

• A circular stability test for general polynomials
• A deterministic algorithm for isolating real roots of a real polynomial
• An inequality for the discriminant of a polynomial
• Diophantine equations with power sums and universal Hilbert sets
• Distance between conjugate algebraic numbers in clusters
• Finiteness of integral values for the ratio of two linear recurrences
• Generalized radix representations and dynamical systems. IV
• How many zeros of a random polynomial are real?
• scientific article; zbMATH DE number 1296286 (Why is no real title available?)
• On the complexity of the Descartes method when using approximate arithmetic
• ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
• On the distribution of polynomials with bounded roots. I: Polynomials with real coefficients
• On the distribution of reducible polynomials
• Polynomial root separation
• Root separation for irreducible integer polynomials
• Root separation for reducible integer polynomials
• Zero location of polynomials with respect to the unit-circle unhampered by nonessential singularities

Cited in

(12)

• Effective results on the Skolem problem for linear recurrence sequences
• On the number of monic integer polynomials with given signature
• The weak converse of Zeckendorf's theorem
• On the distance between two algebraic numbers
• Counting decomposable polynomials with integer coefficients
• Absolute real root separation
• Counting degenerate polynomials of fixed degree and bounded height
• Absolute root separation
• Linear recurrent cryptography: Golden-like cryptography for higher order linear recurrences
• Counting integer polynomials with several roots of maximal modulus
• On certain polytopes associated to products of algebraic integer conjugates
• Positive density of integer polynomials with some prescribed properties

This page was built for publication: Counting and testing dominant polynomials

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