Magma

Computer algebra system (CAS). Magma is a large, well-supported software package designed for computations in algebra, number theory, algebraic geometry and algebraic combinatorics. It provides a mathematically rigorous environment for defining and working with structures such as groups, rings, fields, modules, algebras, schemes, curves, graphs, designs, codes and many others. Magma also supports a number of databases designed to aid computational research in those areas of mathematics which are algebraic in nature. The overview provides a summary of Magma’s main features. One of the aims whilst developing Magma is to maintain extensive documentation describing the features of the system. This handbook is available online. The documentation section should help introduce new users to the Magma language. Magma is distributed by the Computational Algebra Group at the University of Sydney. Its development has benefited enormously from contributions made by many members of the mathematical community. We encourage all users to report any bugs they find; regular patch fixes are available from the downloads section.

This software is also referenced in ORMS.


References in zbMATH (referenced in 3315 articles , 5 standard articles )

Showing results 3241 to 3260 of 3315.
Sorted by year (citations)
  1. Curtis, R. T.: Symmetric generation and existence of Janko group (J_1) (1999)
  2. de Graaf, W. A.: Using Cartan subalgebras to calculate nilradicals and Levi subalgebras of Lie algebras (1999)
  3. Ebert, G. L.; Hirschfeld, J. W. P.: Complete systems of lines on a Hermitian surface over a finite field (1999)
  4. Eick, Bettina; O’Brien, E. A.: Enumerating (p)-groups (1999)
  5. Ellis, Graham; Kholodna, Irina: Computing second cohomology of finite groups with trivial coefficients (1999)
  6. Ellis, Graham; Kholodna, Irina: Three-dimensional presentations for the groups of order at most 30 (1999)
  7. Evans-Riley, Susan; Newman, M. F.; Schneider, Csaba: On the soluble length of groups with prime-power order (1999)
  8. Fang, Xin Gui; Havas, George; Praeger, Cheryl E.: On the automorphism groups of quasiprimitive almost simple graphs (1999)
  9. Faugère, Jean-Charles: A new efficient algorithm for computing Gröbner bases ((F_4)) (1999)
  10. Giudici, Michael; Praeger, Cheryl E.: Completely transitive codes in Hamming graphs (1999)
  11. Havas, George; Majewski, Bohdan S.; Matthews, Keith R.: Addenda and errata: ”Extended GCD and Hermite normal form algorithms via lattice basis reduction”. (1999)
  12. Havas, George; Sims, Charles C.: A presentation for the Lyons simple group (1999)
  13. Holt, Derek F.; Rees, Sarah: Computing with Abelian sections of finitely presented groups (1999)
  14. Hulpke, Alexander: Computing subgroups invariant under a set of automorphisms (1999)
  15. Karagueuzian, Dikran B.; Symonds, Peter: The module structure of a group action on a polynomial ring (1999)
  16. Kemper, Gregor; Malle, Gunter: Invariant fields of finite irreducible reflection groups (1999)
  17. Kemper, Gregor; Steel, Allan: Some algorithms in invariant theory of finite groups (1999)
  18. Kontogeorgis, Aristides: The group of automorphisms of cyclic extensions of rational function fields (1999)
  19. Koshitani, Shigeo; Waki, Katsushi: On Loewy structure of the projective modules of the Mathieu group (M_12) and its automorphism group in characteristic (3) (1999)
  20. Koshitani, Shigeo; Waki, Katsushi: The Green correspondents of the Mathieu group (M_12) in characteristic (3) (1999)

Further publications can be found at: http://magma.maths.usyd.edu.au/magma/citations/