Simple Groups Stabilizing Polynomials
نویسندگان
چکیده
We study the problem of determining, for a polynomial function f on a vector space V , the linear transformations g of V such that f ◦ g = f . When f is invariant under a simple algebraic group G acting irreducibly on V , we note that the subgroup of GL(V ) stabilizing f often has identity component G, and we give applications realizing various groups, including the largest exceptional group E8, as automorphism groups of polynomials and algebras. We show that, starting with a simple group G and an irreducible representation V , one can almost always find an f whose stabilizer has identity component G, and that no such f exists in the short list of excluded cases. This relies on our core technical result, the enumeration of inclusions G < H 6 SL(V ) such that V/H has the same dimension as V/G. The main results of this paper are new even in the special case where k is the complex numbers. 2010 Mathematics Subject Classification: 20G15 (primary); 15A72, 20G41 (secondary)
منابع مشابه
Some results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملGeneric Polynomials and Noether's Problem for Linear Groups
It is well known that an aarmative answer to Noether's Problem for a permutation group G leads to a parametric representation for all polynomials which have G as Galois group. In the rst section of the present paper it is shown that in the case of a linear group G acting on an m-dimensional vector space over a eld K, an aarmative answer aaords a generic polynomial g(t 1 extension N=L with L K a...
متن کاملOrthogonal Polynomials of Compact Simple Lie Groups
Recursive algebraic construction of two infinite families of polynomials in n variables is proposed as a uniform method applicable to every semisimple Lie group of rank n. Its result recognizes Chebyshev polynomials of the first and second kind as the special case of the simple group of type A1. The obtained not Laurent-type polynomials are equivalent to the partial cases of theMacdonald symmet...
متن کاملDesign of PID controllers for interval plants with time delay
First of all, the box theorem is extended to the interval plants with the fixed delay. An approach is presented to design the PID controller for interval plants with the fixed delay, which can obtain all of the stabilizing PID controllers. Then, using Hermite–Biehler theorem, extreme point results are provided by the virtual quasi-polynomials. When two virtual and two vertex quasi-polynomials c...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کامل