Generic Polynomials with Few Parameters

Gregor Kemper, Elena Mattig

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

We call a polynomial g(t1, . . . , tm,X ) over a field K generic for a group G if it has Galois group G as a polynomial inX , and if every Galois field extension N/L withK ⊆L and Gal(N/L) ≤G arises as the splitting field of a suitable specializationg (λ1, . . . , λm, X) withλi ∈L. We discuss how the rationality of the invariant field of a faithful linear representation leads to a generic polynomial which is often particularly simple and therefore useful. Then we consider various examples and applications in characteristic 0 and in positive characteristic. These include results on so-called vectorial polynomials and a generalization of an embedding criterion given by Abhyankar. We give recursive formulas for generic polynomials over a field of defining characteristic for the groups of upper unipotent and upper triangular matrices, and explicit formulae for generic polynomials for the groups GU2(q2) andGO3 (q).

Original languageEnglish
Pages (from-to)843-857
Number of pages15
JournalJournal of Symbolic Computation
Volume30
Issue number6
DOIs
StatePublished - Dec 2000
Externally publishedYes

Fingerprint

Dive into the research topics of 'Generic Polynomials with Few Parameters'. Together they form a unique fingerprint.

Cite this