|
Janko Group J1
In the area of modern algebra known as group theory, the Janko group ''J1'' is a sporadic simple group of Order (group theory), order : 175,560 = 233571119 : ≈ 2. History ''J1'' is one of the 26 sporadic groups and was originally described by Zvonimir Janko in 1965. It is the only Janko group whose existence was proved by Janko himself and was the first sporadic group to be found since the discovery of the Mathieu groups in the 19th century. Its discovery launched the modern theory of sporadic groups. In 1986 Robert Arnott Wilson, Robert A. Wilson showed that ''J1'' cannot be a subgroup of the monster group. Thus it is one of the 6 sporadic groups called the pariah group, pariahs. Properties The smallest faithful complex representation of ''J1'' has dimension 56. ''J1'' can be characterized abstractly as the unique simple group with abelian Sylow theorems, 2-Sylow subgroups and with an Involution (mathematics), involution whose centralizer is isomorphic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field (mathematics), fields, and vector spaces, can all be seen as groups endowed with additional operation (mathematics), operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and Standard Model, three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also cen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John G
John is a common English name and surname: * John (given name) * John (surname) John may also refer to: New Testament Works * Gospel of John, a title often shortened to John * First Epistle of John, often shortened to 1 John * Second Epistle of John, often shortened to 2 John * Third Epistle of John, often shortened to 3 John People * John the Baptist (died ), regarded as a prophet and the forerunner of Jesus Christ * John the Apostle (died ), one of the twelve apostles of Jesus Christ * John the Evangelist, assigned author of the Fourth Gospel, once identified with the Apostle * John of Patmos, also known as John the Divine or John the Revelator, the author of the Book of Revelation, once identified with the Apostle * John the Presbyter, a figure either identified with or distinguished from the Apostle, the Evangelist and John of Patmos Other people with the given name Religious figures * John, father of Andrew the Apostle and Saint Peter * Pope John ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Block Design
In combinatorial mathematics, a block design is an incidence structure consisting of a set together with a family of subsets known as ''blocks'', chosen such that number of occurrences of each element satisfies certain conditions making the collection of blocks exhibit symmetry (balance). Block designs have applications in many areas, including experimental design, finite geometry, physical chemistry, software testing, cryptography, and algebraic geometry. Without further specifications the term ''block design'' usually refers to a balanced incomplete block design (BIBD), specifically (and also synonymously) a 2-design, which has been the most intensely studied type historically due to its application in the design of experiments. Its generalization is known as a t-design. Overview A design is said to be ''balanced'' (up to ''t'') if all ''t''-subsets of the original set occur in equally many (i.e., ''λ'') blocks. When ''t'' is unspecified, it can usually be assumed to be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distance-transitive Graph
In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices and at any distance , and any other two vertices and at the same distance, there is an automorphism of the graph that carries to and to . Distance-transitive graphs were first defined in 1971 by Norman L. Biggs and D. H. Smith. A distance-transitive graph is interesting partly because it has a large automorphism group. Some interesting finite groups are the automorphism groups of distance-transitive graphs, especially of those whose diameter is 2. Examples Some first examples of families of distance-transitive graphs include: * The Johnson graphs. * The Grassmann graphs. * The Hamming Graphs (including Hypercube graphs). * The folded cube graphs. * The square rook's graphs. * The Livingstone graph. Classification of cubic distance-transitive graphs After introducing them in 1971, Biggs Biggs may refer to: Arts and entertainment * B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Livingstone Graph
In the mathematical field of graph theory, the Livingstone graph is a distance-transitive graph with 266 vertices and 1463 edges. Its intersection array In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two Vertex (graph theory), vertices and , the number of vertices at distance (graph theory), distance from and at distance from depends ... is . It is the largest distance-transitive graph with degree 11. Algebraic properties The automorphism group of the Livingstone graph is the sporadic simple group J1, and the stabiliser of a point is PSL(2,11). As the stabiliser is maximal in J1, it acts primitively on the graph. As the Livingstone graph is distance-transitive, PSL(2,11) acts transitively on the set of 11 vertices adjacent to a reference vertex ''v'', and also on the set of 12 vertices at distance 4 from ''v''. The second action is equivalent to the standard action of PSL(2,11) on the projective line over ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group 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 group, 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 group, 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 field (mathematics), fiel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leonard Eugene Dickson
Leonard Eugene Dickson (January 22, 1874 – January 17, 1954) was an American mathematician. He was one of the first American researchers in abstract algebra, in particular the theory of finite fields and classical groups, and is also remembered for a three-volume history of number theory, '' History of the Theory of Numbers''. The L. E. Dickson instructorships at the University of Chicago Department of Mathematics are named after him. Life Dickson considered himself a Texan by virtue of having grown up in Cleburne, where his father was a banker, merchant, and real estate investor. He attended the University of Texas at Austin, where George Bruce Halsted encouraged his study of mathematics. Dickson earned a B.S. in 1893 and an M.S. in 1894, under Halsted's supervision. Dickson first specialised in Halsted's own specialty, geometry. A. A. Albert (1955Leonard Eugene Dickson 1874–1954from National Academy of Sciences Both the University of Chicago and Harvard University ... [...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 (mathematics), field that contains a finite number of Element (mathematics), elements. As with any field, a finite field is a Set (mathematics), 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 the integers mod n, integers mod p when p 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 p and every positive integer k there are fields of order p^k. All finite fields of a given order are isomorphism, 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 that is a fiel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthogonal Matrix
In linear algebra, an orthogonal matrix, or orthonormal matrix, is a real square matrix whose columns and rows are orthonormal vectors. One way to express this is Q^\mathrm Q = Q Q^\mathrm = I, where is the transpose of and is the identity matrix. This leads to the equivalent characterization: a matrix is orthogonal if its transpose is equal to its inverse: Q^\mathrm=Q^, where is the inverse of . An orthogonal matrix is necessarily invertible (with inverse ), unitary (), where is the Hermitian adjoint ( conjugate transpose) of , and therefore normal () over the real numbers. The determinant of any orthogonal matrix is either +1 or −1. As a linear transformation, an orthogonal matrix preserves the inner product of vectors, and therefore acts as an isometry of Euclidean space, such as a rotation, reflection or rotoreflection. In other words, it is a unitary transformation. The set of orthogonal matrices, under multiplication, forms the group , known as th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Modular Representation
Modular representation theory is a branch of mathematics, and is the part of representation theory that studies linear representations of finite groups over a field ''K'' of positive characteristic ''p'', necessarily a prime number. As well as having applications to group theory, modular representations arise naturally in other branches of mathematics, such as algebraic geometry, coding theory, combinatorics and number theory. Within finite group theory, character-theoretic results proved by Richard Brauer using modular representation theory played an important role in early progress towards the classification of finite simple groups, especially for simple groups whose characterization was not amenable to purely group-theoretic methods because their Sylow 2-subgroups were too small in an appropriate sense. Also, a general result on embedding of elements of order 2 in finite groups called the Z* theorem, proved by George Glauberman using the theory developed by Brauer, was p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Conjugacy Class
In mathematics, especially group theory, two elements a and b of a group are conjugate if there is an element g in the group such that b = gag^. This is an equivalence relation whose equivalence classes are called conjugacy classes. In other words, each conjugacy class is closed under b = gag^ for all elements g in the group. Members of the same conjugacy class cannot be distinguished by using only the group structure, and therefore share many properties. The study of conjugacy classes of non-abelian groups is fundamental for the study of their structure. For an abelian group, each conjugacy class is a set containing one element ( singleton set). Functions that are constant for members of the same conjugacy class are called class functions. Definition Let G be a group. Two elements a, b \in G are conjugate if there exists an element g \in G such that gag^ = b, in which case b is called of a and a is called a conjugate of b. In the case of the general linear group \op ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
O'Nan Group
In the area of abstract algebra known as group theory, the O'Nan group ''O'N'' or O'Nan–Sims group is a sporadic simple group of order : 460,815,505,920 = 2934573111931 ≈ 5. History ''O'N'' is one of the 26 sporadic groups and was found by in a study of groups with a Sylow 2-subgroup of " Alperin type", meaning isomorphic to a Sylow 2-Subgroup of a group of type (Z/2''n''Z ×Z/2''n''Z ×Z/2''n''Z).PSL3(F2). The following simple groups have Sylow 2-subgroups of Alperin type: * For the Chevalley group ''G''2(q), if q is congruent to 3 or 5 mod 8, ''n = 1'' and the extension does not split. * For the Steinberg group 3''D''4(q), if q is congruent to 3 or 5 mod 8, ''n = 1'' and the extension does not split. * For the alternating group A8, ''n = 1'' and the extension splits. * For the O'Nan group, ''n'' = 2 and the extension does not split. * For the Higman-Sims group, ''n'' = 2 and the extension splits. The Schur multiplier has order 3, and its outer a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
