𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generic Polynomials with Few Parameters

✍ Scribed by Gregor Kemper; Elena Mattig


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
335 KB
Volume
30
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis


We call a polynomial g(t 1 , . . . , tm, 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 βŠ† L and Gal(N/L) ≀ G arises as the splitting field of a suitable specialization g(Ξ» 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 GU 2 (q 2 ) and GO 3 (q).


πŸ“œ SIMILAR VOLUMES


On robust stability of polynomials with
✍ D. Kaesbauer πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 227 KB

AImrad--We consider real polynomials whose coefficients depend polynomially on the elements of an uncertain parameter vector. The size of perturbation is characterized by the weighted norm of the parameter vector. The smallest destabilizing perturbation defines the stability radius of the set of unc

Multi-parameter Polynomials with Given G
✍ Gunter Malle πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 282 KB

We present a collection of multi-parameter polynomials for several mostly non-solvable permutation groups of small degree and describe their construction. As an application we are able to obtain totally real number fields with these Galois groups over the rationals, for example for the two small Mat

Interpolation by Generalized Polynomials
✍ S.S. Xu πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 270 KB

In 1990, A. Horwitz proved a theorem about interpolation by restricted range polynomials and asked some ralted questions. This paper gives affirmative answers to Horwitz' questions and generalizes his theorem. 1993 Academic Press. Inc.

A Six Generalized Squares Theorem, with
✍ Paula B. Cohen; Amitai Regev πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 113 KB

The theories of superalgebras and of P.I. algebras lead to a natural β€«ήšβ€¬ -graded 2 extension of the integers. For these generalized integers, a ''six generalized squares'' theorem is proved, which can be considered as a β€«ήšβ€¬ -graded analogue of 2 the classical ''four squares'' theorem for the natural

Probabilistic design of systems with gen
✍ K. Ponnambalam; Abbas Seifi; Jiri Vlach πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

## Abstract This paper presents a new method for finding optimal solutions of systems with design parameters which are random variables distributed with various general and possibly non‐symmetrical distributions. A double‐bounded density function is used to approximate the distributions. Specificat