An Algorithm of Katz and its Application to the Inverse Galois Problem

74Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we present a new and elementary approach for proving the main results of Katz (1996) using the Jordan-Pochhammer matrices of Takano and Bannai (1976) and Haraoka (1994). We find an explicit version of the middle convolution of Katz (1996) that connects certain tuples of matrices in linear groups. From this, Katz' existence algorithm for rigid tuples in linear groups can easily be deduced. It can further be shown that the convolution operation on tuples commutes with the braid group action. This yields a new approach in inverse Galois theory for realizing subgroups of linear groups regularly as Galois groups over Q. This approach is then applied to realize numerous series of classical groups regularly as Galois groups over Q. In the Appendix we treat an additive version of the convolution. © 2000 Academic Press.

Cite

CITATION STYLE

APA

Dettweiler, M., & Reiter, S. (2000). An Algorithm of Katz and its Application to the Inverse Galois Problem. Journal of Symbolic Computation, 30(6), 761–798. https://doi.org/10.1006/jsco.2000.0382

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free