This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Harada–Norton group | |
|---|---|
| Name | Harada–Norton group |
| Order | 273030912000000 |
| Notation | HN |
| Discovered | 1970s |
| Classification | Sporadic simple group |
Harada–Norton group
The Harada–Norton group is a sporadic simple group of order 2^14·3^6·5^6·7·11·19, named after Kōichirō Harada and Simon P. Norton. It occupies a place among the 26 sporadic groups and relates to structures in the Monster and other sporadic Conway-related constructions; it appears in contexts involving the Leech lattice, the Griess algebra, and lattice automorphism studies. The group's discovery and analysis connect to work by researchers at institutions such as the University of Tokyo, the University of Cambridge, and the Institute for Advanced Study.
The Harada–Norton group sits among the 20th-century discoveries in finite group theory alongside Fischer groups, Janko groups, and Baby Monster. It was identified through investigations into local subgroup structures related to 20th-century classification efforts by figures including John Conway, Robert Griess, and Bernd Fischer. Its constructions use concepts from the Leech lattice, binary Golay code, and vertex operator algebra methods developed by researchers at the University of Cambridge and the University of Chicago.
Constructions of the Harada–Norton group arise from several frameworks: as a subquotient of automorphism groups of the Leech lattice, via the Griess algebra introduced by Robert Griess, and through vertex operator algebra approaches inspired by work of Richard Borcherds and Igor Frenkel. Representation theory analyses exploit connections to modular representation theory scholars such as Graham Higman, J. L. Alperin, and Daniel Gorenstein. Permutation representations involve actions on sets related to the Leech lattice and coset spaces associated with maximal subgroups isomorphic to extensions of groups like Alt(5), PSL_2(19), GL_2(5), Suzuki-type components, and groups studied by Michael Aschbacher. Ordinary representations were computed following algorithms by John Conway, while modular reductions reference work by Hans Feit and Richard Parker.
The Harada–Norton group exhibits local subgroups containing elements of orders 2, 3, 5, 7, 11, and 19, with maximal subgroups including ones isomorphic to direct or semidirect products involving Alt(5), PSL_2(19), and centralizers resembling those in Monster-related contexts. Structural analysis uses transfer theorems from Walter Feit and signalizer functor techniques developed by Charles Sims and John Thompson. The centralizer of a 2A-involution has shape 2^1+8:Sym(9) in analogous studies by Bernd Fischer and John G. Thompson, while 5A-elements give rise to subgroups correlated with SL_2(5), referencing classification strategies used by Aschbacher and Michael Collins. Maximal subgroup classifications were advanced through computations by Robert Wilson and Simeon P. Norton-collaborators.
The Harada–Norton group's relationships to the Monster derive from embeddings of its representations into the Griess algebra and from vertex operator algebra connections first explored by Richard Borcherds in his proof of the moonshine conjectures. It shares local subgroup configurations with other sporadic groups such as Baby Monster, Fischer, Conway groups, McLaughlin, and Higman–Sims. Moonshine phenomena tying modular functions studied by John McKay and John Conway to sporadic character values include instances where Harada–Norton character values match coefficients in series connected to the Monstrous Moonshine program of Conway and Norton and Borcherds.
The ordinary character table was computed using techniques from Richard Brauer’s modular character theory and computational group theory tools pioneered by Donald Knuth-era algorithms and implemented by groups led by John Conway and Robert Wilson. Modular representations over fields of characteristic 2, 3, and 5 have been studied leveraging block theory developed by Kiyoshi Iwasawa-inspired specialists and the Alperin–Brauer–Gorenstein framework. Decomposition matrices and Brauer characters were tabulated following computational advances from projects at the Atlas of Finite Groups consortium involving J. H. Conway, S. P. Norton, Robert Curtis, and Wilson.
The Harada–Norton group was isolated in the 1970s through independent investigations by Kōichirō Harada and Simon P. Norton, building on classifications initiated by Bernd Fischer and consolidated by the Gorenstein–Lyons–Solomon project. Early recognition involved comparisons of local subgroup patterns with those catalogued in the Atlas of Finite Groups compiled by Conway, Curtis, Norton, Parker, and Wilson. Subsequent confirmations used character theoretic arguments developed by Feit and Thompson and computational verifications enabled by institutions such as the University of Cambridge and the University of Birmingham.
Occurrences include roles in the study of finite simple groups catalogued in the Atlas of Finite Groups, implications for the theory of vertex operator algebras following work by Frenkel, Lepowsky, and Meurman, and appearances in moonshine-related correspondences explored by Conway and Norton and Borcherds. Connections to lattice theory leverage the Leech lattice studied by John Conway and Neil Sloane, and applications in string-theoretic models cite parallels with symmetry groups used in Conformal field theory research by Goddard and Olive. Computational group theory tools developed by GAP contributors and MAGMA developers facilitate further study.
Category:Sporadic groups