GAP

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 1803 articles , 2 standard articles )

Showing results 1781 to 1800 of 1803.
Sorted by year (citations)

previous 1 2 3 ... 88 89 90 91 next

  1. Murray, Scott H.; O’Brien, E.A.: Selecting base points for the Schreier-Sims algorithm for matrix groups (1995)
  2. Neubüser, J.: An invitation to computational group theory (1995)
  3. Pahlings, H.: Character polynomials and the Möbius function (1995)
  4. Pasechnik, Dmitrii V.: Extending polar spaces of rank at least 3 (1995)
  5. Pasechnik, Dmitrii V.: Extended generalized octagons and the group $He$ (1995)
  6. Ruškuc, N.: Matrix semigroups -- generators and relations (1995)
  7. Bremke, Kirsten: The decomposition numbers of Hecke algebras of type $F\sb 4$ with unequal parameters (1994)
  8. Cooperman, Gene; Finkelstein, Larry: A random base change algorithm for permutation groups (1994)
  9. Niemeyer, Alice C.: A finite soluble quotient algorithm (1994)
  10. Cohen, Arjeh M.; Griess, Robert L.jun.; Lisser, Bert: The group $L(2,61)$ embeds in the Lie group of type $E\sb 8$ (1993)
  11. Cohen, Henri: A course in computational algebraic number theory (1993)
  12. Soicher, Leonard H.: GRAPE: A system for computing with graphs and groups (1993)
  13. Geck, Meinolf; Pfeiffer, Götz: Unipotent characters of the Chevalley groups $D\sb 4(q)$, $q$ odd (1992)
  14. Holt, Derek F.; Rees, Sarah: An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups (1992)
  15. 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)
  16. Baum, Ulrich; Shokrollahi, Mohammad Amin: An optimal algorithm for multiplication in $\bbfF\sb256/\bbfF\sb 4$ (1991)
  17. Cooperman, Gene; Finkelstein, Larry: A strong generating test and short presentations for permutation groups (1991)
  18. Geck, Meinolf; Lux, Klaus: The decomposition numbers of the Hecke algebra of type $F\sb 4$ (1991)
  19. Kimmerle, Wolfgang: Beiträge zur ganzzahligen Darstellungstheorie endlicher Gruppen. (Contributions to the integral representation theory of finite groups) (1991)
  20. Linton, S.A.: Constructing matrix representations of finitely presented groups (1991)

previous 1 2 3 ... 88 89 90 91 next


Further publications can be found at: http://www.gap-system.org/Doc/Bib/bib.html