|
Generalized Symmetric Group
In mathematics, the generalized symmetric group is the wreath product S(m,n) := Z_m \wr S_n of the cyclic group of order ''m'' and the symmetric group of order ''n''. Examples * For m=1, the generalized symmetric group is exactly the ordinary symmetric group: S(1,n) = S_n. * For m=2, one can consider the cyclic group of order 2 as positives and negatives (Z_2 \cong \) and identify the generalized symmetric group S(2,n) with the signed symmetric group. Representation theory There is a natural representation of elements of S(m,n) as generalized permutation matrices, where the nonzero entries are ''m''-th roots of unity: Z_m \cong \mu_m. The representation theory has been studied since ; see references in . As with the symmetric group, the representations can be constructed in terms of Specht modules; see . Homology The first group homology group (concretely, the abelianization) is Z_m \times Z_2 (for ''m'' odd this is isomorphic to Z_): the Z_m factors (which are all conj ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wreath Product
In group theory, the wreath product is a special combination of two groups based on the semidirect product. It is formed by the action of one group on many copies of another group, somewhat analogous to exponentiation. Wreath products are used in the classification of permutation groups and also provide a way of constructing interesting examples of groups. Given two groups A and H (sometimes known as the ''bottom'' and ''top''), there exist two variations of the wreath product: the unrestricted wreath product A \text H and the restricted wreath product A \text H. The general form, denoted by A \text_ H or A \text_ H respectively, requires that H acts on some set \Omega; when unspecified, usually \Omega = H (a regular wreath product), though a different \Omega is sometimes implied. The two variations coincide when A, H, and \Omega are all finite. Either variation is also denoted as A \wr H (with \wr for the LaTeX symbol) or ''A'' ≀ ''H'' (Unicode U+2240). The notion ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Group
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element ''g'' such that every other element of the group may be obtained by repeatedly applying the group operation to ''g'' or its inverse. Each element can be written as an integer power of ''g'' in multiplicative notation, or as an integer multiple of ''g'' in additive notation. This element ''g'' is called a '' generator'' of the group. Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order ''n'' is isomorphic to the additive group of Z/''n''Z, the integers modulo ''n''. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetric Group
In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group \mathrm_n defined over a finite set of n symbols consists of the permutations that can be performed on the n symbols. Since there are n! (n factorial) such permutation operations, the order (number of elements) of the symmetric group \mathrm_n is n!. Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set. The symmetric group is important to diverse areas of mathematics such as Galois theory, invariant theory, the repres ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Signed Symmetric Group
In mathematics, a hyperoctahedral group is an important type of group that can be realized as the group of symmetries of a hypercube or of a cross-polytope. It was named by Alfred Young in 1930. Groups of this type are identified by a parameter , the dimension of the hypercube. As a Coxeter group it is of type , and as a Weyl group it is associated to the symplectic groups and with the orthogonal groups in odd dimensions. As a wreath product it is S_2 \wr S_n where is the symmetric group of degree . As a permutation group, the group is the signed symmetric group of permutations ''π'' either of the set or of the set such that for all . As a matrix group, it can be described as the group of orthogonal matrices whose entries are all integers. Equivalently, this is the set of matrices with entries only 0, 1, or –1, which are invertible, and which have exactly one non-zero entry in each row or column. The representation theory of the hyperoctahedral group ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generalized Permutation Matrices
In mathematics, a generalized permutation matrix (or monomial matrix) is a matrix with the same nonzero pattern as a permutation matrix, i.e. there is exactly one nonzero entry in each row and each column. Unlike a permutation matrix, where the nonzero entry must be 1, in a generalized permutation matrix the nonzero entry can be any nonzero value. An example of a generalized permutation matrix is :\begin 0 & 0 & 3 & 0\\ 0 & -7 & 0 & 0\\ 1 & 0 & 0 & 0\\ 0 & 0 & 0 & \sqrt2\end. Structure An invertible matrix ''A'' is a generalized permutation matrix if and only if it can be written as a product of an invertible diagonal matrix ''D'' and an (implicitly invertible) permutation matrix ''P'': i.e., :A = DP. Group structure The set of ''n'' × ''n'' generalized permutation matrices with entries in a field ''F'' forms a subgroup of the general linear group GL(''n'', ''F''), in which the group of nonsingular diagonal matrices Δ(''n'', ''F'') forms a normal subgro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Roots Of Unity
In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power . Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform. Roots of unity can be defined in any field. If the characteristic of the field is zero, the roots are complex numbers that are also algebraic integers. For fields with a positive characteristic, the roots belong to a finite field, and, conversely, every nonzero element of a finite field is a root of unity. Any algebraically closed field contains exactly th roots of unity, except when is a multiple of the (positive) characteristic of the field. General definition An ''th root of unity'', where is a positive integer, is a number satisfying the equation :z^n = 1. Unless otherwise specified, the roots of unity may be taken to be complex numbers (inc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Specht Module
In mathematics, a Specht module is one of the representations of symmetric groups studied by . They are indexed by partitions, and in characteristic 0 the Specht modules of partitions of ''n'' form a complete set of irreducible representations of the symmetric group on ''n'' points. Definition Fix a partition λ of ''n'' and a commutative ring ''k''. The partition determines a Young diagram with ''n'' boxes. A Young tableau of shape λ is a way of labelling the boxes of this Young diagram by distinct numbers 1, \dots, n. A tabloid is an equivalence class of Young tableaux where two labellings are equivalent if one is obtained from the other by permuting the entries of each row. For each Young tableau ''T'' of shape λ let \ be the corresponding tabloid. The symmetric group on ''n'' points acts on the set of Young tableaux of shape λ. Consequently, it acts on tabloids, and on the free ''k''-module ''V'' with the tabloids as basis. Given a Young table ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Homology
In mathematics (more specifically, in homological algebra), group cohomology is a set of mathematical tools used to study groups using cohomology theory, a technique from algebraic topology. Analogous to group representations, group cohomology looks at the group actions of a group ''G'' in an associated ''G''-module ''M'' to elucidate the properties of the group. By treating the ''G''-module as a kind of topological space with elements of G^n representing ''n''- simplices, topological properties of the space may be computed, such as the set of cohomology groups H^n(G,M). The cohomology groups in turn provide insight into the structure of the group ''G'' and ''G''-module ''M'' themselves. Group cohomology plays a role in the investigation of fixed points of a group action in a module or space and the quotient module or space with respect to a group action. Group cohomology is used in the fields of abstract algebra, homological algebra, algebraic topology and algebraic number theory ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abelianization
In mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators of the group. The commutator subgroup is important because it is the smallest normal subgroup such that the quotient group of the original group by this subgroup is abelian. In other words, G/N is abelian if and only if N contains the commutator subgroup of G. So in some sense it provides a measure of how far the group is from being abelian; the larger the commutator subgroup is, the "less abelian" the group is. Commutators For elements g and h of a group ''G'', the commutator of g and h is ,h= g^h^gh. The commutator ,h/math> is equal to the identity element ''e'' if and only if gh = hg , that is, if and only if g and h commute. In general, gh = hg ,h/math>. However, the notation is somewhat arbitrary and there is a non-equivalent variant definition for the commutator that has the inverses on the right hand side of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schur Multiplier
In mathematical group theory, the Schur multiplier or Schur multiplicator is the second homology group H_2(G, \Z) of a group ''G''. It was introduced by in his work on projective representations. Examples and properties The Schur multiplier \operatorname(G) of a finite group ''G'' is a finite abelian group whose exponent divides the order of ''G''. If a Sylow ''p''-subgroup of ''G'' is cyclic for some ''p'', then the order of \operatorname(G) is not divisible by ''p''. In particular, if all Sylow ''p''-subgroups of ''G'' are cyclic, then \operatorname(G) is trivial. For instance, the Schur multiplier of the nonabelian group of order 6 is the trivial group since every Sylow subgroup is cyclic. The Schur multiplier of the elementary abelian group of order 16 is an elementary abelian group of order 64, showing that the multiplier can be strictly larger than the group itself. The Schur multiplier of the quaternion group is trivial, but the Schur multiplier of dihedral 2-group ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
