Generic polynomial

Generic polynomial

In Galois theory, a branch of modern algebra, a generic polynomial for a finite group "G" and field "F" is a monic polynomial "P" with coefficients in the field "L" = "F"("t"1, ..., "t""n") of "F" with "n" indeterminates adjoined, such that the splitting field "M" of "P" has Galois group "G" over "L", and such that every extension "K"/"F" with Galois group "G" can be obtained as the splitting field of a polynomial which is the specialization of "P" resulting from setting the "n" indeterminates to "n" elements of "F". This is sometimes called "F-generic" relative to the field "F", with a Q-"generic" polynomial, generic relative to the rational numbers, being called simply generic.

The existence, and especially the construction, of a generic polynomial for a given Galois group provides a complete solution to the inverse Galois problem for that group. However, not all Galois groups have generic polynomials, a counterexample being the cyclic group of order eight.

Groups with generic polynomials

* The symmetric group "S""n". This is trivial, as

:x^n + t_1 x^{n-1} + cdots + t_n

is a generic polynomial for "S""n".

* Cyclic groups "C""n", where "n" is not divisible by eight. Lenstra showed that a cyclic group does not have a generic polynomial if "n" is divisible by eight, and Smith explicitly constructs such a polynomial in case "n" is not divisible by eight.

* The cyclic group construction leads to other classes of generic polynomials; in particular the dihedral group "D""n" has a generic polynomial if and only if n is not divisible by eight.

* The quaternion group "Q"8.

* Heisenberg groups H_{p^3} for any odd prime "p".

* The alternating group "A"4.

* The alternating group "A"5.

* Reflection groups defined over Q, including in particular groups of the root systems for "E"6, "E"7, and "E"8

* Any group which is a direct product of two groups both of which have generic polynomials.

* Any group which is a wreath product of two groups both of which have generic polynomials.

Examples of generic polynomials

Generic Dimension

The generic dimension for a finite group "G" over a field "F", denoted gd_{F}G, is defined as the minimal number of parameters in a generic polynomial for "G" over "F", or infty if no generic polynomial exists.

Examples:

*gd_{mathbb{QA_3=1

*gd_{mathbb{QS_3=1

*gd_{mathbb{QD_4=2

*gd_{mathbb{QD_5=2

Publications

*Jensen, Christian U., Ledet, Arne, and Yui, Noriko, "Generic Polynomials", Cambridge University Press, 2002


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Polynomial lemniscate — In mathematics, a polynomial lemniscate or polynomial level curve is a plane algebraic curve of degree 2n, constructed from a polynomial p with complex coefficients of degree n.For any such polynomial p and positive real number c, we may define a …   Wikipedia

  • Generic property — In mathematics, properties that hold for typical examples are called generic properties. For instance, a generic property of a class of functions is one that is true of almost all of those functions, as in the statements, A generic polynomial… …   Wikipedia

  • Generic Stream Encapsulation — Internet protocol suite Application layer BGP DHCP DNS FTP HTTP …   Wikipedia

  • List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

  • Regular chain — In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular… …   Wikipedia

  • Zariski topology — In algebraic geometry, the Zariski topology is a particular topology chosen for algebraic varieties that reflects the algebraic nature of their definition. It is due to Oscar Zariski and took a place of particular importance in the field around… …   Wikipedia

  • Master theorem — For a result in enumerative combinatorics, see MacMahon Master theorem. In the analysis of algorithms, the master theorem provides a cookbook solution in asymptotic terms (using Big O notation) for recurrence relations of types that occur in the… …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • Normal distribution — This article is about the univariate normal distribution. For normally distributed vectors, see Multivariate normal distribution. Probability density function The red line is the standard normal distribution Cumulative distribution function …   Wikipedia

  • Scheme (mathematics) — In mathematics, a scheme is an important concept connecting the fields of algebraic geometry, commutative algebra and number theory. Schemes were introduced by Alexander Grothendieck so as to broaden the notion of algebraic variety; some consider …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”