New simple algorithms for computing the minimal polynomial of cos(2π/n)

DOI10.1142/S1793830917500598zbMATH Open1378.12001MaRDI QIDQ4595247FDOQ4595247

Authors: Faïçal Bouazizi, Zaineb Guetif, Sami Hidouri 

Publication date: 29 November 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

minimal polynomialGalois groupGaloisian idealtriangular idealLagrange resolvents

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Algebraic number theory computations (11Y40)

Cites Work

• The Minimal Polynomial of cos(2π/n)
• Sur les relations entre les racines d'un polynôme
• Using Galois ideals for computing relative resolvents

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: New simple algorithms for computing the minimal polynomial of cos(2π/n)

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