|
Zassenhaus Group
In mathematics, a Zassenhaus group, named after Hans Zassenhaus, is a certain sort of doubly transitive permutation group very closely related to rank-1 groups of Lie type. Definition A Zassenhaus group is a permutation group ''G'' on a finite set ''X'' with the following three properties: * ''G'' is doubly transitive. *Non-trivial elements of ''G'' fix at most two points. *''G'' has no regular normal subgroup. ("Regular" means that non-trivial elements do not fix any points of ''X''; compare free action.) The degree of a Zassenhaus group is the number of elements of ''X''. Some authors omit the third condition that ''G'' has no regular normal subgroup. This condition is put in to eliminate some "degenerate" cases. The extra examples one gets by omitting it are either Frobenius groups or certain groups of degree 2''p'' and order 2''p''(2''p'' − 1)''p'' for a prime ''p'', that are generated by all semilinear mappings and Galois automorphisms of a field of orde ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hans Zassenhaus
Hans Julius Zassenhaus (28 May 1912 – 21 November 1991) was a German mathematician, known for work in many parts of abstract algebra, and as a pioneer of computer algebra. Biography He was born in Koblenz in 1912. His father was a historian and advocate for Reverence for Life as expressed by Albert Schweitzer. Hans had two brothers, Guenther and Wilfred, and sister Hiltgunt, who wrote an autobiography in 1974. According to her, their father lost his position as school principal due to his philosophy. She wrote:Hiltgunt Zassenhaus (1974) ''Walls: Resisting the Third Reich'', Beacon Press :Hans, my eldest brother, studied mathematics. My brothers Guenther and Wilfred were in medical school. ... only students who participated in Nazi activities would get scholarships. That left us out. Together we made an all-out effort. ... soon our house became a beehive. Day in and day out for the next four years a small army of children of all ages would arrive to be tutored. At the University ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doubly Transitive Permutation Group
A group G acts 2-transitively on a set S if it acts transitively on the set of distinct ordered pairs \. That is, assuming (without a real loss of generality) that G acts on the left of S, for each pair of pairs (x,y),(w,z)\in S\times S with x \neq y and w\neq z, there exists a g\in G such that g(x,y) = (w,z). The group action is sharply 2-transitive if such g\in G is unique. A 2-transitive group is a group such that there exists a group action that's 2-transitive and faithful. Similarly we can define sharply 2-transitive group. Equivalently, gx = w and gy = z, since the induced action on the distinct set of pairs is g(x,y) = (gx,gy). The definition works in general with ''k'' replacing 2. Such multiply transitive permutation groups can be defined for any natural number ''k''. Specifically, a permutation group ''G'' acting on ''n'' points is ''k''-transitive if, given two sets of points ''a''1, ... ''a''''k'' and ''b''1, ... ''b''''k'' with the property that all the ''a''''i'' a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Groups Of Lie Type
In mathematics, specifically in group theory, the phrase ''group of Lie type'' usually refers to finite groups that are closely related to the group of rational points of a reductive linear algebraic group with values in a finite field. The phrase ''group of Lie type'' does not have a widely accepted precise definition, but the important collection of finite simple groups of Lie type does have a precise definition, and they make up most of the groups in the classification of finite simple groups. The name "groups of Lie type" is due to the close relationship with the (infinite) Lie groups, since a compact Lie group may be viewed as the rational points of a reductive linear algebraic group over the field of real numbers. and are standard references for groups of Lie type. Classical groups An initial approach to this question was the definition and detailed study of the so-called ''classical groups'' over finite and other fields by . These groups were studied by L. E. Dickson ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Normal Subgroup
In abstract algebra, a normal subgroup (also known as an invariant subgroup or self-conjugate subgroup) is a subgroup that is invariant under conjugation by members of the group of which it is a part. In other words, a subgroup N of the group G is normal in G if and only if gng^ \in N for all g \in G and n \in N. The usual notation for this relation is N \triangleleft G. Normal subgroups are important because they (and only they) can be used to construct quotient groups of the given group. Furthermore, the normal subgroups of G are precisely the kernels of group homomorphisms with domain G, which means that they can be used to internally classify those homomorphisms. Évariste Galois was the first to realize the importance of the existence of normal subgroups. Definitions A subgroup N of a group G is called a normal subgroup of G if it is invariant under conjugation; that is, the conjugation of an element of N by an element of G is always in N. The usual notation for this re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Action
In mathematics, a group action on a space is a group homomorphism of a given group into the group of transformations of the space. Similarly, a group action on a mathematical structure is a group homomorphism of a group into the automorphism group of the structure. It is said that the group ''acts'' on the space or structure. If a group acts on a structure, it will usually also act on objects built from that structure. For example, the group of Euclidean isometries acts on Euclidean space and also on the figures drawn in it. For example, it acts on the set of all triangles. Similarly, the group of symmetries of a polyhedron acts on the vertices, the edges, and the faces of the polyhedron. A group action on a vector space is called a representation of the group. In the case of a finite-dimensional vector space, it allows one to identify many groups with subgroups of , the group of the invertible matrices of dimension over a field . The symmetric group acts on any set w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frobenius Group
In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius. Structure Suppose ''G'' is a Frobenius group consisting of permutations of a set ''X''. A subgroup ''H'' of ''G'' fixing a point of ''X'' is called a Frobenius complement. The identity element together with all elements not in any conjugate of ''H'' form a normal subgroup called the Frobenius kernel ''K''. (This is a theorem due to ; there is still no proof of this theorem that does not use character theory, although see .) The Frobenius group ''G'' is the semidirect product of ''K'' and ''H'': :G=K\rtimes H. Both the Frobenius kernel and the Frobenius complement have very restricted structures. proved that the Frobenius kernel ''K'' is a nilpotent group. If ''H'' has even order then ''K'' is abelian. The Frobenius complement ''H'' has the property t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semilinear Map
In linear algebra, particularly projective geometry, a semilinear map between vector spaces ''V'' and ''W'' over a field ''K'' is a function that is a linear map "up to a twist", hence ''semi''-linear, where "twist" means "field automorphism of ''K''". Explicitly, it is a function that is: * additive with respect to vector addition: T(v+v') = T(v)+T(v') * there exists a field automorphism ''θ'' of ''K'' such that T(\lambda v) = \lambda^\theta T(v), where \lambda^\theta is the image of the scalar \lambda under the automorphism. If such an automorphism exists and ''T'' is nonzero, it is unique, and ''T'' is called ''θ''-semilinear. Where the domain and codomain are the same space (i.e. ), it may be termed a semilinear transformation. The invertible semilinear transforms of a given vector space ''V'' (for all choices of field automorphism) form a group, called the general semilinear group and denoted \operatorname(V), by analogy with and extending the general linear group. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod when is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number and every positive integer there are fields of order p^k, all of which are isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero) are ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Special Linear Group
In mathematics, especially in the group theoretic area of algebra, the projective linear group (also known as the projective general linear group or PGL) is the induced action of the general linear group of a vector space ''V'' on the associated projective space P(''V''). Explicitly, the projective linear group is the quotient group :PGL(''V'') = GL(''V'')/Z(''V'') where GL(''V'') is the general linear group of ''V'' and Z(''V'') is the subgroup of all nonzero scalar transformations of ''V''; these are quotiented out because they act trivially on the projective space and they form the kernel of the action, and the notation "Z" reflects that the scalar transformations form the center of the general linear group. The projective special linear group, PSL, is defined analogously, as the induced action of the special linear group on the associated projective space. Explicitly: :PSL(''V'') = SL(''V'')/SZ(''V'') where SL(''V'') is the special linear group over ''V'' and SZ(''V'') is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective General Linear Group
In mathematics, especially in the group theoretic area of algebra, the projective linear group (also known as the projective general linear group or PGL) is the induced action of the general linear group of a vector space ''V'' on the associated projective space P(''V''). Explicitly, the projective linear group is the quotient group :PGL(''V'') = GL(''V'')/Z(''V'') where GL(''V'') is the general linear group of ''V'' and Z(''V'') is the subgroup of all nonzero scalar transformations of ''V''; these are quotiented out because they act trivially on the projective space and they form the kernel of the action, and the notation "Z" reflects that the scalar transformations form the center of the general linear group. The projective special linear group, PSL, is defined analogously, as the induced action of the special linear group on the associated projective space. Explicitly: :PSL(''V'') = SL(''V'')/SZ(''V'') where SL(''V'') is the special linear group over ''V'' and SZ(''V'') is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Index Of A Subgroup
In mathematics, specifically group theory, the index of a subgroup ''H'' in a group ''G'' is the number of left cosets of ''H'' in ''G'', or equivalently, the number of right cosets of ''H'' in ''G''. The index is denoted , G:H, or :H/math> or (G:H). Because ''G'' is the disjoint union of the left cosets and because each left coset has the same size as ''H'', the index is related to the orders of the two groups by the formula :, G, = , G:H, , H, (interpret the quantities as cardinal numbers if some of them are infinite). Thus the index , G:H, measures the "relative sizes" of ''G'' and ''H''. For example, let G = \Z be the group of integers under addition, and let H = 2\Z be the subgroup consisting of the even integers. Then 2\Z has two cosets in \Z, namely the set of even integers and the set of odd integers, so the index , \Z:2\Z, is 2. More generally, , \Z:n\Z, = n for any positive integer ''n''. When ''G'' is finite, the formula may be written as , G:H, = , G, /, H, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
