On Computing Factors of Cyclotomic Polynomials

DOI10.2307/2152941zbMath0785.11011arXiv1004.5466OpenAlexW2949246973WikidataQ56939130 ScholiaQ56939130MaRDI QIDQ3137454

Richard P. Brent

Publication date: 1 November 1993

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

zbMATH Keywords

algorithmsgenerating functionsfactorizationcyclotomic polynomial

Mathematics Subject Classification ID

Related Items (8)

A deformation of the class number formula of real quadratic fields ⋮ Fast arithmetics in Artin-Schreier towers over finite fields ⋮ Aurifeuillian factorizations and the period of the Bell numbers modulo a prime ⋮ Classification of characteristic polynomials of simple supersingular abelian varieties over finite fields ⋮ A note on cyclotomic polynomials ⋮ Aurifeuillian factorization ⋮ Unnamed Item ⋮ On the minimal polynomial of Gauss periods for prime powers

Cites Work

• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Fast Algorithms for Manipulating Formal Power Series
• Prime numbers and computer methods for factorization
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Computing Factors of Cyclotomic Polynomials