Computing Galois groups by means of Newton polygons
Michael Kölle, Peter Schmid (2004)
Acta Arithmetica
Similarity:
Michael Kölle, Peter Schmid (2004)
Acta Arithmetica
Similarity:
Farshid Hajir (2005)
Journal de Théorie des Nombres de Bordeaux
Similarity:
Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be “large.” For a fixed , Filaseta and Lam have shown that the th degree Generalized Laguerre Polynomial is irreducible for all large enough . We use our criterion to show that, under these conditions, the Galois group of is either the alternating or symmetric group on letters, generalizing results of Schur for .
Ido Efrat, Ján Mináč (2012)
Acta Arithmetica
Similarity:
Helen Grundman, Tara Smith (2010)
Open Mathematics
Similarity:
This article provides necessary and sufficient conditions for each group of order 32 to be realizable as a Galois group over an arbitrary field. These conditions, given in terms of the number of square classes of the field and the triviality of specific elements in related Brauer groups, are used to derive a variety of automatic realizability results.
Helen Grundman, Tara Smith (2010)
Open Mathematics
Similarity:
This article examines the realizability of groups of order 64 as Galois groups over arbitrary fields. Specifically, we provide necessary and sufficient conditions for the realizability of 134 of the 200 noncyclic groups of order 64 that are not direct products of smaller groups.
Núria Vila (1992)
Publicacions Matemàtiques
Similarity:
The problem of the construction of number fields with Galois group over Q a given finite groups has made considerable progress in the recent years. The aim of this paper is to survey the current state of this problem, giving the most significant methods developed in connection with it.
Kurt Girstmair (2007)
Acta Arithmetica
Similarity:
Kurt Girstmair (1983)
Manuscripta mathematica
Similarity:
Gudrun Brattström (1989)
Mathematica Scandinavica
Similarity:
Bernat Plans, Núria Vila (2005)
Journal de Théorie des Nombres de Bordeaux
Similarity:
This paper considers some refined versions of the Inverse Galois Problem. We study the local or global behavior of rational specializations of some finite Galois covers of .
Michailov, Ivo (2007)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 12F12. We find the obstructions to realizability of groups of order 32 as Galois groups over arbitrary field of characteristic not 2. We discuss explicit extensions and automatic realizations as well. This work is partially supported by project of Shumen University
Julia Hartmann (2002)
Banach Center Publications
Similarity:
This note extends the algorithm of [hess] for computing unimodular Galois groups of irreducible differential equations of order four. The main tool is invariant theory.
Ehud Hrushovski (2002)
Banach Center Publications
Similarity:
Helmut Völklein (1992)
Mathematische Annalen
Similarity:
Nour Ghazi (2011)
Acta Arithmetica
Similarity: