Search results
Results from the WOW.Com Content Network
One context in which symmetric polynomial functions occur is in the study of monic univariate polynomials of degree n having n roots in a given field.These n roots determine the polynomial, and when they are considered as independent variables, the coefficients of the polynomial are symmetric polynomial functions of the roots.
The cycle index polynomial of a permutation group is the average of the cycle index monomials of its elements. The phrase cycle indicator is also sometimes used in place of cycle index . Knowing the cycle index polynomial of a permutation group, one can enumerate equivalence classes due to the group 's action .
The complete homogeneous symmetric polynomials are characterized by the following identity of formal power series in t: = (, …,) = = = = = (this is called the generating function, or generating series, for the complete homogeneous symmetric polynomials).
Aside from polynomial functions, tensors that act as functions of several vectors can be symmetric, and in fact the space of symmetric -tensors on a vector space is isomorphic to the space of homogeneous polynomials of degree on . Symmetric functions should not be confused with even and odd functions, which have a different sort of symmetry.
A cyclic group is a group which is equal to one of its cyclic subgroups: G = g for some element g, called a generator of G. For a finite cyclic group G of order n we have G = {e, g, g 2, ... , g n−1}, where e is the identity element and g i = g j whenever i ≡ j (mod n); in particular g n = g 0 = e, and g −1 = g n−1.
Note that 3 is a factor of 6.) The number of such polynomials is the index in the symmetric group S n of the subgroup H of permutations that preserve the polynomial. (For the example of x + y − z, the subgroup H in S 3 contains the identity and the transposition (x y).) So the size of H divides n!. With the later development of abstract ...
For every symmetric group other than S 6, there is no other conjugacy class consisting of elements of order 2 that has the same number of elements as the class of transpositions. Or as follows: Each permutation of order two (called an involution ) is a product of k > 0 disjoint transpositions, so that it has cyclic structure 2 k 1 n −2 k .
In mathematics, the representation theory of the symmetric group is a particular case of the representation theory of finite groups, for which a concrete and detailed theory can be obtained. This has a large area of potential applications, from symmetric function theory to quantum chemistry studies of atoms, molecules and solids.