HOME
*





Generalized Permutation Matrix
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 subgroup. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

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 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Permutation Matrices
In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column and 0s elsewhere. Each such matrix, say , represents a permutation of elements and, when used to multiply another matrix, say , results in permuting the rows (when pre-multiplying, to form ) or columns (when post-multiplying, to form ) of the matrix . Definition Given a permutation of ''m'' elements, :\pi : \lbrace 1, \ldots, m \rbrace \to \lbrace 1, \ldots, m \rbrace represented in two-line form by :\begin 1 & 2 & \cdots & m \\ \pi(1) & \pi(2) & \cdots & \pi(m) \end, there are two natural ways to associate the permutation with a permutation matrix; namely, starting with the ''m'' × ''m'' identity matrix, , either permute the columns or permute the rows, according to . Both methods of defining permutation matrices appear in the literature and the properties expressed in one representation can be easily converted to the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Ring (mathematics)
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ''ring'' is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series. Formally, a ''ring'' is an abelian group whose operation is called ''addition'', with a second binary operation called ''multiplication'' that is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors use the term " " with a missing i to refer to the more general structure that omits this last requirement; see .) Whether a ring is commutative (that is, whether the order in which two elements are multiplied might change the result) has ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set. Permutations differ from combinations, which are selections of some members of a set regardless of order. For example, written as tuples, there are six permutations of the set , namely (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). These are all the possible orderings of this three-element set. Anagrams of words whose letters are different are also permutations: the letters are already ordered in the original word, and the anagram is a reordering of the letters. The study of permutations of finite sets is an important topic in the fields of combinatorics and group theory. Permutations are used in almost every branch of mathematics, and in many other fields of scie ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Sign Of A Permutation
In mathematics, when ''X'' is a finite set with at least two elements, the permutations of ''X'' (i.e. the bijective functions from ''X'' to ''X'') fall into two classes of equal size: the even permutations and the odd permutations. If any total ordering of ''X'' is fixed, the parity (oddness or evenness) of a permutation \sigma of ''X'' can be defined as the parity of the number of inversions for ''σ'', i.e., of pairs of elements ''x'', ''y'' of ''X'' such that and . The sign, signature, or signum of a permutation ''σ'' is denoted sgn(''σ'') and defined as +1 if ''σ'' is even and −1 if ''σ'' is odd. The signature defines the alternating character of the symmetric group S''n''. Another notation for the sign of a permutation is given by the more general Levi-Civita symbol (''ε''''σ''), which is defined for all maps from ''X'' to ''X'', and has value zero for non-bijective maps. The sign of a permutation can be explicitly expressed as : where ''N''(''σ ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Nonnegative Matrices
In mathematics, the sign of a real number is its property of being either positive, negative, or zero. Depending on local conventions, zero may be considered as being neither positive nor negative (having no sign or a unique third sign), or it may be considered both positive and negative (having both signs). Whenever not specifically mentioned, this article adheres to the first convention. In some contexts, it makes sense to consider a signed zero (such as floating-point representations of real numbers within computers). In mathematics and physics, the phrase "change of sign" is associated with the generation of the additive inverse (negation, or multiplication by −1) of any object that allows for this construction, and is not restricted to real numbers. It applies among other objects to vectors, matrices, and complex numbers, which are not prescribed to be only either positive, negative, or zero. The word "sign" is also often used to indicate other binary aspects of mathemat ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Centralizer
In mathematics, especially group theory, the centralizer (also called commutant) of a subset ''S'' in a group ''G'' is the set of elements \mathrm_G(S) of ''G'' such that each member g \in \mathrm_G(S) commutes with each element of ''S'', or equivalently, such that conjugation by g leaves each element of ''S'' fixed. The normalizer of ''S'' in ''G'' is the set of elements \mathrm_G(S) of ''G'' that satisfy the weaker condition of leaving the set S \subseteq G fixed under conjugation. The centralizer and normalizer of ''S'' are subgroups of ''G''. Many techniques in group theory are based on studying the centralizers and normalizers of suitable subsets ''S''. Suitably formulated, the definitions also apply to semigroups. In ring theory, the centralizer of a subset of a ring is defined with respect to the semigroup (multiplication) operation of the ring. The centralizer of a subset of a ring ''R'' is a subring of ''R''. This article also deals with centralizers and normaliz ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Maximal Torus
In the mathematical theory of compact Lie groups a special role is played by torus subgroups, in particular by the maximal torus subgroups. A torus in a compact Lie group ''G'' is a compact, connected, abelian Lie subgroup of ''G'' (and therefore isomorphic to the standard torus T''n''). A maximal torus is one which is maximal among such subgroups. That is, ''T'' is a maximal torus if for any torus ''T''′ containing ''T'' we have ''T'' = ''T''′. Every torus is contained in a maximal torus simply by dimensional considerations. A noncompact Lie group need not have any nontrivial tori (e.g. R''n''). The dimension of a maximal torus in ''G'' is called the rank of ''G''. The rank is well-defined since all maximal tori turn out to be conjugate. For semisimple groups the rank is equal to the number of nodes in the associated Dynkin diagram. Examples The unitary group U(''n'') has as a maximal torus the subgroup of all diagonal matrices. That is, : T = \left\. ''T'' is clearl ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Weyl Group
In mathematics, in particular the theory of Lie algebras, the Weyl group (named after Hermann Weyl) of a root system Φ is a subgroup of the isometry group of that root system. Specifically, it is the subgroup which is generated by reflections through the hyperplanes orthogonal to the roots, and as such is a finite reflection group. In fact it turns out that ''most'' finite reflection groups are Weyl groups. Abstractly, Weyl groups are finite Coxeter groups, and are important examples of these. The Weyl group of a semisimple Lie group, a semisimple Lie algebra, a semisimple linear algebraic group, etc. is the Weyl group of the root system of that group or algebra. Definition and examples Let \Phi be a root system in a Euclidean space V. For each root \alpha\in\Phi, let s_\alpha denote the reflection about the hyperplane perpendicular to \alpha, which is given explicitly as :s_\alpha(v)=v-2\frac\alpha, where (\cdot,\cdot) is the inner product on V. The Weyl group W of \Phi is ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Quotient Group
A quotient group or factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure (the rest of the structure is "factored" out). For example, the cyclic group of addition modulo ''n'' can be obtained from the group of integers under addition by identifying elements that differ by a multiple of n and defining a group structure that operates on each such class (known as a congruence class) as a single entity. It is part of the mathematical field known as group theory. For a congruence relation on a group, the equivalence class of the identity element is always a normal subgroup of the original group, and the other equivalence classes are precisely the cosets of that normal subgroup. The resulting quotient is written G\,/\,N, where G is the original group and N is the normal subgroup. (This is pronounced G\bmod N, where \mbox is short for modulo.) Much of the importance o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Abelian Group
In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after early 19th century mathematician Niels Henrik Abel. The concept of an abelian group underlies many fundamental algebraic structures, such as fields, rings, vector spaces, and algebras. The theory of abelian groups is generally simpler than that of their non-abelian counterparts, and finite abelian groups are very well understood and fully classified. Definition An abelian group is a set A, together with an operation \cdot that combines any two elements a and b of A to form another element of A, denoted a \cdot b. The symbo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




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]