Generic polynomials with few parameters (Q5927997)

In the paper under review the authors call a polynomial \(g(t_1,\ldots,t_m,X)\) over a field \(K\) generic for a group \(G\) if it has Galois group \(G\) as a polynomial in \(X\), and if every Galois field extension \(N/L\) with \( K \subseteq L\) and \(\text{Gal}(N/L) \leq G\) arises as the splitting field of a suitable specialization \(g(\lambda_1,\ldots,\lambda_m,X)\) with \(\lambda_i \in L.\) NEWLINENEWLINENEWLINEIn the first section they present a construction principle for generic polynomials, which depends on finding a positive answer to Noether's Problem for a linear representation. The generic polynomials constructed in this way have in general fewer parameters and are simpler than those constructed from permutation representations. NEWLINENEWLINENEWLINEIn the second section they apply this principle to several examples in characteristic zero and in positive characteristic. As a result a recursion formula for generic polynomials over a field in defining characteristic is obtained for upper unipotent und upper triangular matrices, and explicit formulae for generic polynomials are given for the groups \(GU_2(q^2)\) and \(GO_3(q).\)