Block Systems of a Galois Group

DOI10.1080/10586458.1995.10504303zbMATH Open0976.12006OpenAlexW2083357849MaRDI QIDQ4867488FDOQ4867488

Authors: A. Hulpke 

Publication date: 14 June 1999

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1062621138

Recommendations

• On computing subfields. A detailed description of the algorithm
• An efficient algorithm for the computation of Galois automorphisms
• scientific article
• Computing subfields of number fields and applications to Galois group computations
• scientific article; zbMATH DE number 1075588

zbMATH Keywords

algorithmGalois groupsubfieldsblock systems

Mathematics Subject Classification ID

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

Cites Work

• Computing Galois groups over the rationals
• Factoring polynomials with rational coefficients
• Simplification of expressions involving radicals
• Solvability by radicals is in polynomial time
• Title not available (Why is that?)
• A polynomial reduction algorithm
• Factoring Polynomials Over Algebraic Number Fields
• Title not available (Why is that?)
• An \(\widehat{A_4}\) extension of \({\mathbb{Q}}\) attached to a non-selfdual automorphic form on \(GL(3)\)
• Computation of Galois groups over function fields
• Ideal decompositions and subfields

Cited In (4)

• Fusion systems of blocks of finite groups over arbitrary fields
• On computing subfields. A detailed description of the algorithm
• The complexity of computing all subfields of an algebraic number field
• Linear groups and computation

Uses Software

• GAP
• Maple
• PARI/GP

This page was built for publication: Block Systems of a Galois Group

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