GAP is a system for computational discrete algebra, with particular emphasis on Computational Group Theory. GAP provides a programming language, a library of thousands of functions implementing algebraic algorithms written in the GAP language as well as large data libraries of algebraic objects. See also the overview and the description of the mathematical capabilities. GAP is used in research and teaching for studying groups and their representations, rings, vector spaces, algebras, combinatorial structures, and more. The system, including source, is distributed freely. You can study and easily modify or extend it for your special use. Computer algebra system (CAS).

This software is also referenced in ORMS.

References in zbMATH (referenced in 2957 articles , 3 standard articles )

Showing results 2941 to 2957 of 2957.
Sorted by year (citations)

previous 1 2 3 ... 146 147 148

  1. Miller, Alice Ann; Praeger, Cheryl E.: Non-Cayley vertex-transitive graphs of order twice the product of two odd primes (1994)
  2. Niemeyer, Alice C.: A finite soluble quotient algorithm (1994)
  3. Cohen, Arjeh M.; Griess, Robert L. jun.; Lisser, Bert: The group (L(2,61)) embeds in the Lie group of type (E_ 8) (1993)
  4. Cohen, Henri: A course in computational algebraic number theory (1993)
  5. Conder, Marston: Hexagon-free subgraphs of hypercubes (1993)
  6. Soicher, Leonard H.: GRAPE: A system for computing with graphs and groups (1993)
  7. Geck, Meinolf; Pfeiffer, Götz: Unipotent characters of the Chevalley groups (D_ 4(q)), (q) odd (1992)
  8. Holt, Derek F.; Rees, Sarah: An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups (1992)
  9. Nickel, Werner; Niemeyer, Alice C.; O’Keefe, Christine M.; Penttila, Tim; Praeger, Cheryl E.: The block-transitive, point-imprimitive 2-(729,8,1) designs (1992)
  10. Baum, Ulrich; Shokrollahi, Mohammad Amin: An optimal algorithm for multiplication in (\mathbbF_256/\mathbbF_ 4) (1991)
  11. Cooperman, Gene; Finkelstein, Larry: A strong generating test and short presentations for permutation groups (1991)
  12. Geck, Meinolf; Lux, Klaus: The decomposition numbers of the Hecke algebra of type (F_ 4) (1991)
  13. Kimmerle, Wolfgang: Beiträge zur ganzzahligen Darstellungstheorie endlicher Gruppen. (Contributions to the integral representation theory of finite groups) (1991)
  14. Linton, S. A.: Constructing matrix representations of finitely presented groups (1991)
  15. Lux, K.; Pahlings, H.: Computational aspects of representation theory of finite groups (1991)
  16. O’Brien, E. A.: The groups of order 256 (1991)
  17. Celler, F.; Neubüser, J.; Wright, C. R. B.: Some remarks on the computation of complements and normalizers in soluble groups (1990)

previous 1 2 3 ... 146 147 148

Further publications can be found at: