Saturday, October 13, 2012: 2:40 AM
Hall 4E/F (WSCC)
Bradley Burdick
,
Mathematics, The Ohio State University, Columbus, OH
Jonathan Jonker
,
Mathematics, Michigan State University, East Lansing, MI
Jorge Morales
,
Mathematics, Louisiana State University, Baton Rouge, LA
The notion of generic polynomial was introduced by DeMeyer for a group
G to be a multivariable polynomial that gives all
G-extensions over a field
k as splitting fields of specializations of the variables. Thus a generic polynomial is nearly equivalent to having a generic
G-extension with the added concreteness of a polynomial. In general a generic polynomial need not exist, failing most notably for abelian groups of order divisible by eight over a field of characteristic zero. General theory has given the existence in many cases and bounds on the number of parameters needed. The minimum number of parameters is an invariant of general interest called the generic dimension.
Our goal is to find explicitly generic polynomials for certain non-abelian groups of degree eight and nine, namely G1 the cyclic group of order two semidirect product the elementary abelian group of order nine, G2 the modular group of order sixteen, and G3=SL(2,3). We follow the method of Kemper and Mattig to compute generic polynomials in arbitrary fields of characteristic relatively prime to the groups' orders. From our computations we establish that the generic dimension of G1 is two. The existence of a generic polynomial for G2 in five parameters is known by Ledet; we lower this number to four. Finally, in an unpublished work from 2000 by Rikuna, the rationality of a four dimensional representation is established for G3. We seek to extend a computation of Groebner for Q8 to a different construction of a generic polynomial for G3.