FiSGO

Contents

  • Home page
  • Tutorial
  • FiSGO's documentation
    • FiSGO.OrderSearch
    • FiSGO.PIrrepsSearch
      • FiSGO.PIrrepsSearch.build_absolute_bound
      • FiSGO.PIrrepsSearch.build_bounds
      • FiSGO.PIrrepsSearch.build_single_bound
      • FiSGO.PIrrepsSearch.factorial_factor
      • FiSGO.PIrrepsSearch.hiss_malle_range
      • FiSGO.PIrrepsSearch.lubeck_bulk_get
      • FiSGO.PIrrepsSearch.pirreps_search
        • pirreps_search()
    • FiSGO.PrimesHandler
    • FiSGO.SimpleGroups
  • Precomputed data
  • Hiss and Malle tables
  • Scripts used to process data
FiSGO
  • FiSGO
  • FiSGO.PIrrepsSearch
  • FiSGO.PIrrepsSearch.pirreps_search

FiSGO.PIrrepsSearch.pirreps_search

pirreps_search(n_range, ignore=None, use_absolute_bound=False, include_origin=False)[source]

Given a dimension or a dimension range, this function tries to search for simple groups containing projective representations within the given range.

This is a high level function, combining most of the functionalities offered by FiSGO into a single function. This function may be quite slow, and produces log information. It is recommended to dump the output of the function into a file for later use and analysis, rather than using it inside a script.

Caution

The end of the range “n_range” is NOT included.

Parameters:
  • n_range (list[int] | int) – Either a positive integer or a pair of positive integers indicating the dimension range of the representation search. Example: 1000 or [222,301]

  • ignore (list[str] | None) – A list of group ID’s to be ignored in the search. Example: [“AA”, “SZ”]

  • use_absolute_bound (bool) – If true, uses an additional absolute bound, see build_absolute_bound()

  • include_origin (bool) – If true, returns the database where each representation was sourced from alongside the degree.

Return type:

tuple[list[tuple[int, str]] | list[tuple[int, str, str]], list[str | Any], list[str | Any]] | None

Returns:

A 3-tuple of lists. The first list contains the projective representation degrees found within the given range. The second list contains all those groups whose data representation data is complete, meaning it is known that no other representations may appear within the range. The third list contains a list of groups whose data may not be complete, meaning there could be representations of such groups within the range that have not been found.

Previous Next

© Copyright .

Built with Sphinx using a theme provided by Read the Docs.