The distance to an irreducible polynomial, II
From MaRDI portal
Publication:2894521
DOI10.1090/S0025-5718-2011-02555-XzbMath1268.11040OpenAlexW2020189493MaRDI QIDQ2894521
Michael J. Mossinghoff, Michael Filaseta
Publication date: 29 June 2012
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02555-x
Polynomials in number theory (11C08) Algebraic number theory computations (11Y40) Polynomials (irreducibility, etc.) (11R09)
Related Items (7)
On an application of the $abc$-theorem for polynomials to the squarefree neighbour problem ⋮ Two questions concerning covering systems ⋮ Covering systems with large moduli associated with reducible shifts of integer polynomials ⋮ The distance to square-free polynomials ⋮ On the nearest irreducible lacunary neighbour to an integer polynomial ⋮ The distance to a squarefree polynomial over $\mathbb F_2[x$] ⋮ On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk
Uses Software
Cites Work
- On a polynomial conjecture of Pál Turán
- Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
- Reducibility of polynomials and covering systems of congruences
- Reducibility of lacunary polynomials II
- Computational experiences on the distances of polynomials to irreducible polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The distance to an irreducible polynomial, II
