We introduce a new method for finding Galois groups, by modifying the p-group generation algorithm using number-theoretical information. Thus, by exhaustive search, we calculate the Galois groups of some p-extensions that were previously beyond reach.
On the computation of resolvents and Galois groups
โ Scribed by Kurt Girstmair
- Publisher
- Springer
- Year
- 1983
- Tongue
- English
- Weight
- 907 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0025-2611
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We propose a conjecture on the distribution of number fields with given Galois group and bounded norm of the discriminant. This conjecture is known to hold for abelian groups. We give some evidence relating the general case to the composition formula for discriminants, give a heuristic argument in f
We give an algorithm to calculate a presentation of the Picard-Vessiot extension associated to a completely reducible linear differential equation (i.e. an equation whose Galois group is reductive). Using this, we show how to compute the Galois group of such an equation as well as properties of the