Searching for the monster in the trees

dc.contributor.author	Craven, David A.
dc.contributor.editor	Randecker, Anja
dc.contributor.editor	Kohlrus, Jan
dc.date.accessioned	2022-04-13T07:29:55Z
dc.date.available	2022-04-13T07:29:55Z
dc.date.issued	2022-04-13
dc.identifier.uri	http://publications.mfo.de/handle/mfo/3935
dc.description.abstract	The Monster finite simple group is almost unimaginably large, with about 8 × 1053 elements in it. Trying to understand such an immense object requires both theory and computer programs. In this snapshot, we discuss finite groups, representations, and finally Brauer trees, which offer some new understanding of this vast and intricate structure.	en_US
dc.language.iso	en	en_US
dc.publisher	Mathematisches Forschungsinstitut Oberwolfach	en_US
dc.relation.ispartofseries	Snapshots of modern mathematics from Oberwolfach;2022-03
dc.rights	Attribution-ShareAlike 4.0 International	*
dc.rights.uri	http://creativecommons.org/licenses/by-sa/4.0/	*
dc.title	Searching for the monster in the trees	en_US
dc.type	Article	en_US
dc.identifier.doi	10.14760/SNAP-2022-003-EN
local.series.id	SNAP-2022-003-EN	en_US
local.subject.snapshot	Algebra and Number Theory	en_US
dc.identifier.urn	urn:nbn:de:101:1-2022112209205649596609
dc.identifier.ppn	1823155537

Except where otherwise noted, this item's license is described as Attribution-ShareAlike 4.0 International