{"size": 764, "ext": "scrbl", "max_stars_repo_path": "math/cgt/cgt.scrbl", "max_stars_repo_name": "markuspf/seress", "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "math/cgt/cgt.scrbl", "max_issues_repo_name": "markuspf/seress", "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "math/cgt/cgt.scrbl", "max_forks_repo_name": "markuspf/seress", "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null}
{"max_stars_count": null, "max_issues_count": null, "max_forks_count": null, "avg_line_length": 36.380952381, "max_line_length": 225, "alphanum_fraction": 0.7212041885}
#lang scribble/doc
@(require scribble/manual
          scribble/basic
          scribble/extract
          (for-label (except-in ffi/unsafe ->)
                     racket
                     math/cgt))

@title[#:tag "top"]{Computational Group Theory in Racket}
@author[(author+email "Markus Pfeiffer" "makx+racket@morphism.de")]

@defmodule[math/cgt]

This package provides implementations of algorithms in computational group theory, currently focusing on permutation groups.
It aims at having clean, simple, and performant implementations of the nearly-linear time library described in Seress' book "Permutation Group Algorithms", and efficient implementations of partition backtrack and extensions..

@local-table-of-contents[]

@include-extracted[math/cgt]

