Baby Monster Group
In the area of modern algebra known as group theory, the baby monster group ''B'' (or, more simply, the baby monster) is a sporadic simple group of order : 241313567211131719233147 : = 4154781481226426191177580544000000 : = 4,154,781,481,226,426,191,177,580,544,000,000 : ≈ 4. ''B'' is one of the 26 sporadic groups and has the second highest order of these, with the highest order being that of the monster group. The double cover of the baby monster is the centralizer of an element of order 2 in the monster group. The outer automorphism group is trivial and the Schur multiplier has order 2. History The existence of this group was suggested by Bernd Fischer in unpublished work from the early 1970s during his investigation of -transposition groups: groups generated by a class of transpositions such that the product of any two elements has order at most 4. He investigated its properties and computed its character table. The first construction of the baby monst ... [...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 ce ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Robert Griess
Robert Louis Griess, Jr. (born 1945, Savannah, Georgia) is a mathematician working on finite simple groups and vertex algebras. He is currently the John Griggs Thompson Distinguished University Professor of mathematics at University of Michigan. Education Griess developed a keen interest in mathematics prior to entering undergraduate studies at the University of Chicago in the fall of 1963. There, he eventually earned a Ph.D. in 1971 under the supervision of John Griggs Thompson after defending a dissertation on the Schur multipliers of the then-known finite simple groups. Research Griess' early work focused on group extensions, cohomology and Schur multipliers, as well as on the classification of finite simple groups and their properties. He was awarded a Guggenheim Fellowship in 1981. In 1982, he published the first construction of the monster group using the Griess algebra, for which he was awarded the 2010 AMS Leroy P. Steele Prize for Seminal Contribution to Research. He ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Dedekind Eta Function
In mathematics, the Dedekind eta function, named after Richard Dedekind, is a modular form of weight 1/2 and is a function defined on the upper half-plane of complex numbers, where the imaginary part is positive. It also occurs in bosonic string theory. Definition For any complex number with , let ; then the eta function is defined by, :\eta(\tau) = e^\frac \prod_^\infty \left(1-e^\right) = q^\frac \prod_^\infty \left(1 - q^n\right) . Raising the eta equation to the 24th power and multiplying by gives :\Delta(\tau)=(2\pi)^\eta^(\tau) where is the modular discriminant. The presence of 24 can be understood by connection with other occurrences, such as in the 24-dimensional Leech lattice. The eta function is holomorphic on the upper half-plane but cannot be continued analytically beyond it. The eta function satisfies the functional equations :\begin \eta(\tau+1) &=e^\frac\eta(\tau),\\ \eta\left(-\frac\right) &= \sqrt\, \eta(\tau).\, \end In the second equation the bra ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Monstrous Moonshine
In mathematics, monstrous moonshine, or moonshine theory, is the unexpected connection between the monster group ''M'' and modular functions, in particular, the ''j'' function. The term was coined by John Conway and Simon P. Norton in 1979. The monstrous moonshine is now known to be underlain by a vertex operator algebra called the moonshine module (or monster vertex algebra) constructed by Igor Frenkel, James Lepowsky, and Arne Meurman in 1988, which has the monster group as its group of symmetries. This vertex operator algebra is commonly interpreted as a structure underlying a two-dimensional conformal field theory, allowing physics to form a bridge between two mathematical areas. The conjectures made by Conway and Norton were proven by Richard Borcherds for the moonshine module in 1992 using the no-ghost theorem from string theory and the theory of vertex operator algebras and generalized Kac–Moody algebras. History In 1978, John McKay found that the first few ter ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Vertex Operator Algebra
In mathematics, a vertex operator algebra (VOA) is an algebraic structure that plays an important role in two-dimensional conformal field theory and string theory. In addition to physical applications, vertex operator algebras have proven useful in purely mathematical contexts such as monstrous moonshine and the geometric Langlands correspondence. The related notion of vertex algebra was introduced by Richard Borcherds in 1986, motivated by a construction of an infinite-dimensional Lie algebra due to Igor Frenkel. In the course of this construction, one employs a Fock space that admits an action of vertex operators attached to lattice vectors. Borcherds formulated the notion of vertex algebra by axiomatizing the relations between the lattice vertex operators, producing an algebraic structure that allows one to construct new Lie algebras by following Frenkel's method. The notion of vertex operator algebra was introduced as a modification of the notion of vertex algebra, by Frenke ... [...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]   |
|
Group Representation
In the mathematical field of representation theory, group representations describe abstract groups in terms of bijective linear transformations of a vector space to itself (i.e. vector space automorphisms); in particular, they can be used to represent group elements as invertible matrices so that the group operation can be represented by matrix multiplication. In chemistry, a group representation can relate mathematical group elements to symmetric rotations and reflections of molecules. Representations of groups are important because they allow many group-theoretic problems to be reduced to problems in linear algebra, which is well understood. They are also important in physics because, for example, they describe how the symmetry group of a physical system affects the solutions of equations describing that system. The term ''representation of a group'' is also used in a more general sense to mean any "description" of a group as a group of transformations of some mathematical o ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Griess Algebra
In mathematics, the Griess algebra is a commutative non-associative algebra on a real vector space of dimension 196884 that has the Monster group In the area of abstract algebra known as group theory, the monster group M (also known as the Fischer–Griess monster, or the friendly giant) is the largest sporadic simple group, having order 246320597611213317192329314147 ... ''M'' as its automorphism group. It is named after mathematician R. L. Griess, who constructed it in 1980 and subsequently used it in 1982 to construct ''M''. The Monster fixes (vectorwise) a 1-space in this algebra and acts absolutely irreducibly on the 196883-dimensional orthogonal complement of this 1-space. (The Monster preserves the standard inner product on the 196884-space.) Griess's construction was later simplified by Jacques Tits and John H. Conway. The Griess algebra is the same as the degree 2 piece of the monster vertex algebra, and the Griess product is one of the vertex alge ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Oxford University Press
Oxford University Press (OUP) is the university press of the University of Oxford. It is the largest university press in the world, and its printing history dates back to the 1480s. Having been officially granted the legal right to print books by decree in 1586, it is the second oldest university press after Cambridge University Press. It is a department of the University of Oxford and is governed by a group of 15 academics known as the Delegates of the Press, who are appointed by the vice-chancellor of the University of Oxford. The Delegates of the Press are led by the Secretary to the Delegates, who serves as OUP's chief executive and as its major representative on other university bodies. Oxford University Press has had a similar governance structure since the 17th century. The press is located on Walton Street, Oxford, opposite Somerville College, in the inner suburb of Jericho. For the last 500 years, OUP has primarily focused on the publication of pedagogical texts and ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
John Horton Conway
John Horton Conway (26 December 1937 – 11 April 2020) was an English mathematician active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He also made contributions to many branches of recreational mathematics, most notably the invention of the cellular automaton called the Game of Life. Born and raised in Liverpool, Conway spent the first half of his career at the University of Cambridge before moving to the United States, where he held the John von Neumann Professorship at Princeton University for the rest of his career. On 11 April 2020, at age 82, he died of complications from COVID-19. Early life and education Conway was born on 26 December 1937 in Liverpool, the son of Cyril Horton Conway and Agnes Boyce. He became interested in mathematics at a very early age. By the time he was 11, his ambition was to become a mathematician. After leaving sixth form, he studied mathematics at Gonville and Caius College, Camb ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Charles Sims (mathematician)
Charles Coffin Sims (April 14, 1937 – October 23, 2017J. J. O'Connor and E. F. Robertson''Charles Sims biography'' MacTutor History of Mathematics archive. Accessed 2018-12-20.) was an American mathematician best known for his work in group theory. Together with Donald G. Higman he discovered the Higman–Sims group, one of the sporadic groups. The permutation group software developed by Sims also led to the proof of existence of the Lyons group (also known as the Lyons–Sims group) and the O'Nan group (also known as the O'Nan–Sims group). Sims was born and raised in Elkhart, Indiana, and received his B.S. from the University of Michigan. He did his graduate studies at Harvard University, where he was a student of John G. Thompson and received his Ph.D. degree in 1963. In his thesis, he enumerated ''p''-groups, giving sharp asymptotic upper and lower bounds. Sims is one of the founders of computational group theory and is the eponym of the Schreier–Sims algorithm. He ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Sporadic Simple Group
In mathematics, a sporadic group is one of the 26 exceptional groups found in the classification of finite simple groups. A simple group is a group ''G'' that does not have any normal subgroups except for the trivial group and ''G'' itself. The classification theorem states that the list of finite simple groups consists of 18 countably infinite plus 26 exceptions that do not follow such a systematic pattern. These 26 exceptions are the sporadic groups. They are also known as the sporadic simple groups, or the sporadic finite groups. Because it is not strictly a group of Lie type, the Tits group is sometimes regarded as a sporadic group, in which case there would be 27 sporadic groups. The monster group is the largest of the sporadic groups, and all but six of the other sporadic groups are subquotients of it. Names Five of the sporadic groups were discovered by Mathieu in the 1860s and the other 21 were found between 1965 and 1975. Several of these groups were predicted to exis ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |