Fischer group Fi23

History

Fi23 is one of the 26 sporadic groups and is one the three Fischer groups introduced by Bernd Fischer (1971, 1976) while investigating 3-transposition groups.

The Schur multiplier and the outer automorphism group are both trivial.

Representations

The Fischer group Fi23 has a rank 3 action on a graph of 31671 vertices corresponding to 3-transpositions, with point stabilizer the double cover of the Fischer group Fi22. It has a second rank-3 action on 137632 points

The smallest faithful complex representation has dimension 782. The group has an irreducible representation of dimension 253 over the field with 3 elements.

Generalized Monstrous Moonshine

Conway and Norton suggested in their 1979 paper that monstrous moonshine is not limited to the monster, but that similar phenomena may be found for other groups. Larissa Queen and others subsequently found that one can construct the expansions of many Hauptmoduln from simple combinations of dimensions of sporadic groups. For Fi23, the relevant McKay-Thompson series is where one can set the constant term a(0) = 42 (OEIS: A030197),

and η(τ) is the Dedekind eta function.

Maximal subgroups

Kleidman, Parker & Wilson (1989) found the 14 conjugacy classes of maximal subgroups of Fi23 as follows:

  • 2.Fi22
  • O8+(3):S3
  • 22.U6(2).2
  • S8(2)
  • O7(3) × S3
  • 211.M23
  • 31+8.21+6.31+2.2S4
  • [310].(L3(3) × 2)
  • S12
  • (22 × 21+8).(3 × U4(2)).2
  • 26+8:(A7 × S3)
  • S6(2) × S4
  • S4(4):4
  • L2(23)
gollark: Password hashing algorithms generally let you pass the salt as a separate parameter.
gollark: Anyway, good password hashing algorithms are designed to be hard to parallelize, and to require large amounts of memory, so that they're hard to implement on FPGAs/ASICs/GPUs and run fastest on general-purpose CPU hardware (this is what your server has).
gollark: Basically!
gollark: Also a salt per password.
gollark: Basically, with passwords, you want a hashing algorithm which is somewhat slow so that it can't be bruteforced.

References

  • Aschbacher, Michael (1997), 3-transposition groups, Cambridge Tracts in Mathematics, 124, Cambridge University Press, doi:10.1017/CBO9780511759413, ISBN 978-0-521-57196-8, MR 1423599 contains a complete proof of Fischer's theorem.
  • Fischer, Bernd (1971), "Finite groups generated by 3-transpositions. I", Inventiones Mathematicae, 13 (3): 232–246, doi:10.1007/BF01404633, ISSN 0020-9910, MR 0294487 This is the first part of Fischer's preprint on the construction of his groups. The remainder of the paper is unpublished (as of 2010).
  • Fischer, Bernd (1976), Finite Groups Generated by 3-transpositions, Preprint, Mathematics Institute, University of Warwick
  • Kleidman, Peter B.; Parker, Richard A.; Wilson, Robert A. (1989), "The maximal subgroups of the Fischer group Fi₂₃", Journal of the London Mathematical Society, Second Series, 39 (1): 89–101, doi:10.1112/jlms/s2-39.1.89, ISSN 0024-6107, MR 0989922
  • Wilson, Robert A. (2009), The finite simple groups, Graduate Texts in Mathematics 251, 251, Berlin, New York: Springer-Verlag, doi:10.1007/978-1-84800-988-2, ISBN 978-1-84800-987-5, Zbl 1203.20012
  • Wilson, R. A. ATLAS of Finite Group Representations.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.