Computing Pro-P Galois Groups [chapter]

Nigel Boston, Harris Nover
2006 Lecture Notes in Computer Science  
We describe methods for explicit computation of Galois groups of certain tamely ramified p-extensions. In the finite case this yields a short list of candidates for the Galois group. In the infinite case it produces a family or few families of likely candidates. The authors would like to thank Rafe Jones, Jeremy Rouse, Rob Rhoades and Jayce Getz for useful discussions.
doi:10.1007/11792086_1 fatcat:ohnvoxecxraszijnrns4q4bixi