✦ LIBER ✦

Symmetric Generation of the Higman-Sims Group

✍ Scribed by R.T. Curtis

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 733 KB
Volume: 171
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1995.1028

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we use the ideas developed in [Curtis, 1990] and [Curtis, 1993] to give a new elementary construction of the Higman-Sims group. The 176 point geometry found by Higman emerges naturally, complete with permutations on the 176 points plus 176 quadrics which generate (H S: 2). In addition, the permutation action of (H S: 2) on 100 points, with point stabilizer (M_{22}: 2), is an easy by-product of this approach. 1995 Academic Press. Inc.

📜 SIMILAR VOLUMES

Characters of the covering group of the

Characters of the covering group of the Higman-Sims group

✍ Arunas Rudvalis 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 494 KB

Computer construction of matrix represen

Computer construction of matrix representations of the covering group of the Higman-Sims group

✍ Ibrahim A Suleiman; Robert A Wilson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 309 KB

The 3- and 5-modular characters of the c

The 3- and 5-modular characters of the covering and the automorphism groups of the Higman-Sims group

✍ Ibrahim A Suleiman; Robert A Wilson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 788 KB

Maximal Independent Generating Sets of t

Maximal Independent Generating Sets of the Symmetric Group

✍ Julius Whiston 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Random sets which invariably generate th

Random sets which invariably generate the symmetric group

✍ John D. Dixon 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Computer generation of the character tab

Computer generation of the character tables of the symmetric groups (Sn)

✍ Xiaoyu Liu; K. Balasubramanian 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 654 KB

Algorithms and codes based on the method of Schur functions and Frobenius' theorem are used to generate the character tables of the symmetric groups (S, ) containing n! elements. The codes developed can generate characters of S, up to n = 20.