DocServer

The Number of Irreducible Factors of a Polynomial, II

Pinner, Christopher and Vaaler, Jeffrey D. (1996) The Number of Irreducible Factors of a Polynomial, II. [Preprint]

[img]
Preview
Postscript
Download (286Kb) | Preview
    [img]
    Preview
    PDF
    Download (228Kb) | Preview

      Abstract

      Given a polynomial $f\in k[x]$, $k$ a number field, we consider bounds on the number of cyclotomic factors of $f$ appropriate when the number of non-zero coefficients of the polynomial, $N(f)$, is substantially less than than its degree. In particular we obtain bounds which (apart from a small degree dependence) are only polynomial in $N(f)$. These results arise from variants of Mann's theorem on linear relations between roots of unity.

      Item Type: Preprint
      Additional Information: pubdom FALSE
      Subjects: UNSPECIFIED
      Faculty: UNSPECIFIED
      Depositing User: Users 1 not found.
      Date Deposited: 28 Nov 2003
      Last Modified: 21 Apr 2010 11:13
      URI: https://docserver.carma.newcastle.edu.au/id/eprint/165

      Actions (login required)

      View Item