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

Showing results 1761 to 1780 of 2191.
Sorted by year (citations)

previous 1 2 3 ... 87 88 89 90 91 ... 108 109 110 next

  1. Assmann, Björn; Eick, Bettina: Computing polycyclic presentations for polycyclic rational matrix groups. (2005)
  2. Babu, H.; Venkataraman, P.: Group action on genus 3 curves and their Weierstrass points (2005)
  3. Bates, Chris; Rowley, Peter: Centralizers of real elements in finite groups. (2005)
  4. Beals, Robert; Leedham-Green, Charles R.; Niemeyer, Alice C.; Praeger, Cheryl E.; Seress, Ákos: Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. (2005)
  5. Becker, Paul E.: Investigation of solvable $(120, 35, 10)$ difference sets (2005)
  6. Bessis, David: Variations on van Kampen’s method (2005)
  7. Bohli, Jens-Matthias; Steinwandt, Rainer; González Vasco, María Isabel; Martínez, Consuelo: Weak keys in MST$_1$ (2005)
  8. Britz, Thomas; Rutherford, Carrie G.: Covering radii are not matroid invariants (2005)
  9. Cameron, Peter J.: Partitions and permutations (2005)
  10. Cameron, Peter J.; Müller, Thomas W.: A descent principle in modular subgroup arithmetic. (2005)
  11. Cameron, Peter J.; Wanless, Ian M.: Covering radius for sets of permutations (2005)
  12. Campbell, C.M.; Campbell, P.P.: The Fibonacci length of certain centro-polyhedral groups. (2005)
  13. Cannon, G.Alan; Neuerburg, Kent M.; Redmond, Shane P.: Zero-divisor graphs of nearrings and semigroups. (2005)
  14. Cannon, John J.; Eick, Bettina; Leedham-Green, Charles R.: Special polycyclic generating sequences for finite soluble groups. (2005)
  15. Chen, William Y.-C.; Torney, David C.: Equivalence classes of matchings and lattice-square designs (2005)
  16. Dabbaghian-Abdoly, Vahid: An algorithm for constructing representations of finite groups. (2005)
  17. Del Padrone, Alessio; Mazza, Carlo: Schur finiteness and nilpotency (2005)
  18. Deza, Michel; Dutour, Mathieu: Zigzag structures of simple two-faced polyhedra (2005)
  19. Dietrich, Heiko; Eick, Bettina: On the groups of cube-free order. (2005)
  20. Donaldson, Alastair; Miller, Alice; Calder, Muffy: Spin-to-Grape: a tool for analysing symmetry in Promela models (2005)

previous 1 2 3 ... 87 88 89 90 91 ... 108 109 110 next


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