Counting degenerate polynomials of fixed degree and bounded height

DOI10.1007/S00605-014-0680-9zbMATH Open1347.11026arXiv1402.5430OpenAlexW2015889637MaRDI QIDQ495309FDOQ495309

Authors: Min Sha, A. Dubickas 

Publication date: 9 September 2015

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Abstract: In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $nge2$ and height bounded by $Hge2$. The polynomial is called degenerate if it has two distinct roots whose quotient is a root of unity. In particular, our bounds imply that non-degenerate linear recurrence sequences can be generated randomly.

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

Recommendations

• On the number of integer polynomials with multiplicatively dependent roots
• Counting decomposable polynomials with integer coefficients
• Roots of unity as quotients of two roots of a polynomial
• On the distribution of polynomials with bounded height
• Zeros of recurrence sequences

zbMATH Keywords

linear recurrencesMahler measureresultantdegenerate polynomial

Mathematics Subject Classification ID

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

Cites Work

• Polynomials irreducible by Eisenstein's criterion
• The distribution of values of Mahler's measure
• Counting algebraic numbers with large height II
• On the number of Eisenstein polynomials of bounded height
• Heights in number fields
• Counting algebraic integers of fixed degree and bounded height
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Abschätzung der Anzahl der reduziblen Polynome
• On the distribution of reducible polynomials
• Reducible Polynomials
• On the number of reducible polynomials of bounded naive height
• On the number of polynomials of bounded height that satisfy the Dumas criterion
• Counting lattice points and O-minimal structures
• Irreducible polynomials with many roots of equal modulus
• Title not available (Why is that?)
• Testing degenerate polynomials
• Irreducible polynomials with many roots of maximal modulus
• Counting and testing dominant polynomials
• ON SUBFIELDS OF A FIELD GENERATED BY TWO CONJUGATE ALGEBRAIC NUMBERS
• Roots of unity as quotients of two roots of a polynomial
• Around Pólya's theorem on the set of prime divisors of a linear recurrence
• Die Seltenheit der reduziblen Gleichungen und der Gleichungen mit Affekt

Cited In (10)

• Roots of unity as quotients of two roots of a polynomial
• Counting and testing dominant polynomials
• Title not available (Why is that?)
• On the number of integer polynomials with multiplicatively dependent roots
• Testing degenerate polynomials
• Cyclotomic quotients of two conjugates of an algebraic number
• Positive density of integer polynomials with some prescribed properties
• On multiplicatively dependent vectors of algebraic numbers
• Counting decomposable polynomials with integer coefficients
• Effective results on the Skolem problem for linear recurrence sequences

This page was built for publication: Counting degenerate polynomials of fixed degree and bounded height

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