Skip to main content

FiSGO: Finite simple groups by order

Project description

📖 FiSGO: Finite simple groups by order

FiSGO is a Python package that aims to provide a solution to the following problems:

  1. Given a number $k$, identify all finite simple groups with order dividing $k$.
  2. Given a range $[n,m]\subset \mathbb{N}$, identify all simple groups with complex irreducible projective representations of degree $d\in [n,m]$.

FiSGO was born as part of the author's bachelor's thesis on the classification of finite irreducible subgroups of $PGL_{n}(\mathbb{C})$. Originally, only point (I) of the previous list was contemplated, and so the current given name of the project.

After the defence of the bachelor's thesis, a survey article was elaborated by greatly expanding on the literature based research, and so FiSGO was reworked and expanded to contemplate point (2).

In tackling point (2), unlike other software such as GAP, SageMath or CHEVIE, FiSGO's methods are less focused on actual character computation, and more centered on a computational implementation of general results involving character degrees, such as general formulas for certain groups, or providing access to already known classifications.

We think of FiSGO more like a tool to efficiently access already existing knowledge (through precomputed data or evaluating formulas), than a tool to actually carry on heavy computational work on the group structure or character computation. This philosophy is exemplified at the start of Section 4.2 Survey article.

Finally, we have decided to use Python and present FiSGO as a Python package so it can be easily integrated with SageMath. There are a few reasons for this. Firstly, SageMath can interface with other software such as [GAP4]_ and Magma, both of which are relevant software in the character theory field. Furthermore, since FiSGO's point (2) is more focused on data treatment and analysis than actual computation, Python seemed ideal.

🧩What can FiSGO do?

We provide a checklist of FiSGO's main features. Those which are green 🟩 are fully implemented, yellow ones 🟨 are partially implemented. Finally, those marked red 🟥 are currently unimplemented and in developement.

  1. 🟩 Given a list of prime powers $N = 2^a3^b5^c\cdots$, identify all finite simple groups with order dividing $N$.
  2. 🟩 Compute/access basic information of any simple group, such as its order, Schur multiplier, recommended notations in LaTeX, etc.
  3. 🟩 Access to all information on ordinary character degrees and multiplicities of the sporadic groups and their coverings.
  4. 🟩 Compute the minimal degree of a complex irreducible projective representation for any simple group as per the results of [TZ96], [Lu01a], [LS74] collected in [TZ00].
  5. 🟨 An interface to the extended Hiss-Malle table, containing all information stored in [[HM02]_ Table 2] alongside the omissions specified in [[HM01]_, Table 2].
  6. 🟩 An interface to all data provided by Frank Lübeck in his website concerning all degrees of irreducible complex representations, together with their multiplicities, of the (non-exceptional) covering groups of Lie type of rank at most 8
  7. 🟥 An implementation of Tiep and Zalesskii's main theorem in [TZ96]_ (also found in [TZ00]_ as Theorem 6.1) concerning the relatively small complex irreducible representations of the quasisimple groups.
  8. 🟨 A function to search for all complex projective irreducible representation data of the simple groups stored in the program (as files or formulas) for a fixed degree or a range of degrees.

The above list contains all features at the top of the priority list of implementation. Other less prioritary potential features are listed below.

  1. 🟥 Interface to the complete Hiss-Malle table, containing all degree less than 251 absolutely irreducible representations of the quasisimple groups in cross characteristic. Obtained by complementing the Hiss-Malle table with the results of [Lu01b].
  2. 🟥 Small rework of the search function for complex projective representations. The idea is to use directly the knowledge on the minimal projective representation instead of an order search using quasi-primitive group bounds.
  3. 🟥 Access to all known Brauer character degrees for the sporadic groups.
  4. 🟥 Interface to Dixon and Zalesskii's results on primitive and imprimitive simple groups of prime degree. See [DZ04], [DZ08] and [DZ98].
  5. 🟥 Computation of the degrees of all complex projective representations of the alternating groups.

Additionally, the GitHub repository contains a directory (FiSGO/HissMalleTableFormats) with a series of files in different formats containing all the data in the Hiss-Malle tables (feature #5), such that anyone can access it and process it themselves. For more information, refer to the documentation or FiSGO/HissMalleTableFormats/README.rst.

🚦Feature status (01/01/2026) ^^^^^^^^^^^^^^^^^^^^^^^^^^^ We breafly describe the status of the partially implemented features.

  1. The only missing data is the field field in the JSON file for the groups ommited from the original Hiss-Malle table, i.e. those listed in the omissions table [[HM01], Table 2].
  2. All searching logic is complete, and the function already works as intended. However, the results of this function can be refined once feature #7 is implemented. Furthermore, auxiliary functions to deal with the function's output may be needed.

📝Documentation and tutorial

All documentation for FiSGO can be found in its [readthedocs website], accessible through the previous link or by clicking the badge.

The documentation comes with a tutorial containing all you need to know to use FiSGO, alongside many examples! Check it out here.

🤝Acknowledgements

This project is licensed under the GNU GENERAL PUBLIC LICENSE (Version 3), see LICENSE for more details.


The author would like to thank Professor Francesc Bars who directed the author's bachelor's thesis and encouraged its refinement in the form of the survey which this software is based on. His support and encouragement during the preparation of FiSGO, alongside his many comments and revisions, have proven to be invaluable.

We would also like to thank Professor Ivan Cheltsov, for proposing turning the bachelor's thesis into a survey in the first place; and Professor G.R. Robinson, for his assistance in accessing his PhD thesis and his comments to improve the finished survey.

The creation and development of this software would not have been realized whithout the assistance of the aforementioned people.


| Gerard Gonzalo Calbetó | Departament Matemàtiques, Edif. C, | Universitat Autònoma de Barcelona, | 08193 Bellaterra, Catalonia, Spain | ggonzalo.math@gmail.com // gerard.gonzalo@uab.cat

📚Project wide references

[HM01] Hiss, G., & Malle, G. (2001). Low-Dimensional Representations of Quasi-Simple Groups. LMS Journal of Computation and Mathematics, 4, 22–63. DOI:10.1112/s1461157000000796

[HM02] Hiss, G., & Malle, G. (2002). Corrigenda: Low-dimensional Representations of Quasi-simple Groups. LMS Journal of Computation and Mathematics, 5, 95–126. DOI:10.1112/s1461157000000711

[Wi25] Wikipedia contributors. (2025, August 22). List of finite simple groups. In Wikipedia, The Free Encyclopedia. Retrieved 21:49, August 30, 2025, from https://en.wikipedia.org/w/index.php?title=List_of_finite_simple_groups&oldid=1307206155

[GAP4] The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.14.0; 2024. (https://www.gap-system.org)

[OEIS] OEIS Foundation Inc.(2025), The On-Line Encyclopedia of Integer Sequences, Published electronically at https://oeis.org.

[TZ00] Tiep, P. H., & Zalesskii, A. E. (2000). Some aspects of finite linear groups: A survey. Journal of Mathematical Sciences, 100(1), 1893–1914. DOI:10.1007/bf02677502

[TZ96] Tiep, P. H., & Zalesskii, A. E. (1996). Minimal characters of the finite classical groups. Communications in Algebra, 24(6), 2093–2167. DOI:10.1080/00927879608825690

[LS74] Landazuri, V., & Seitz, G. M. (1974). On the minimal degrees of projective representations of the finite Chevalley groups. Journal of Algebra, 32(2), 418–443. DOI:10.1016/0021-8693(74)90150-1

[Lu01a] Lübeck, F. (2001). Smallest degrees of representations of exceptional groups of lie type. Communications in Algebra, 29(5), 2147–2169. DOI:10.1081/agb-100002175

[Lu01b] Lübeck, F. (2001). Small Degree Representations of Finite Chevalley Groups in Defining Characteristic. LMS Journal of Computation and Mathematics, 4, 135–169. DOI:10.1112/s1461157000000838

[DZ04] Dixon, J. D., & Zalesski, A. E. (2004). Finite imprimitive linear groups of prime degree. Journal of Algebra, 276(1), 340–370. DOI:10.1016/j.jalgebra.2004.02.005

[DZ08] Dixon, J. D., & Zalesskii, A. E. (2008). Finite primitive linear groups of prime degree. Journal of the London Mathematical Society, 77(3), 808–812. DOI:10.1112/jlms/jdm103

[DZ98] Dixon, J. D., & Zalesskii, A. E. (1998). Finite Primitive Linear Groups of Prime Degree. Journal of the London Mathematical Society, 57(1), 126–134. DOI:10.1112/s0024610798005778

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

fisgo-1.0.1.tar.gz (19.0 MB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

fisgo-1.0.1-py3-none-any.whl (18.9 MB view details)

Uploaded Python 3

File details

Details for the file fisgo-1.0.1.tar.gz.

File metadata

  • Download URL: fisgo-1.0.1.tar.gz
  • Upload date:
  • Size: 19.0 MB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.13.12

File hashes

Hashes for fisgo-1.0.1.tar.gz
Algorithm Hash digest
SHA256 fc5a56b66cf5a76876418e025154c6c9d640a3ff1256aad63f38193fd8dc3ee4
MD5 bcff5117fc9c7efd8a292347fd635d59
BLAKE2b-256 f3d6f102a041252a85ce1b607adf243a72890e58d2daf3a44c20bb3d412ed73d

See more details on using hashes here.

File details

Details for the file fisgo-1.0.1-py3-none-any.whl.

File metadata

  • Download URL: fisgo-1.0.1-py3-none-any.whl
  • Upload date:
  • Size: 18.9 MB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.2.0 CPython/3.13.12

File hashes

Hashes for fisgo-1.0.1-py3-none-any.whl
Algorithm Hash digest
SHA256 818f62d2536cbe7501004e4205a5345a31ec9d2f244640e9013226d81a6ad9b2
MD5 263a96c8c38236bf28e13d7b781173d8
BLAKE2b-256 18f0ab84d7db0d5d171e818eaed3bc38b7b099c6d7eb0947d059f4d61a21f267

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page