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 2299 articles , 4 standard articles )

Showing results 1 to 20 of 2299.
Sorted by year (citations)

1 2 3 ... 113 114 115 next

  1. Alberich-Carramiñana, Maria; Montaner, Josep Àlvarez; Blanco, Guillem: Effective computation of base points of ideals in two-dimensional local rings (2019-2019)
  2. East, James; Egri-Nagy, Attila; Mitchell, James D.; Péresse, Yann: Computing finite semigroups (2019-2019)
  3. Elsenhans, Andreas-Stephan; Klüners, Jürgen: Computing subfields of number fields and applications to Galois group computations (2019-2019)
  4. Jefferson, Christopher; Pfeiffer, Markus; Waldecker, Rebecca: New refiners for permutation group search (2019-2019)
  5. Požar, Rok: Computing stable epimorphisms onto finite groups (2019-2019)
  6. Szutkoski, Jonas; van Hoeij, Mark: The complexity of computing all subfields of an algebraic number field (2019-2019)
  7. Unger, W. R.: An algorithm for computing Schur indices of characters (2019-2019)
  8. Amorós, Laia; Milione, Piermarco: Mumford curves covering (p)-adic Shimura curves and their fundamental domains (2019)
  9. Araya, Makoto; Harada, Masaaki: On the classification of linear complementary dual codes (2019)
  10. Bailey, Geoff; Cohen, Stephen D.; Sutherland, Nicole; Trudgian, Tim: Existence results for primitive elements in cubic and quartic extensions of a finite field (2019)
  11. Balestrieri, Francesca: Brauer-Manin obstruction and families of generalised Châtelet surfaces over number fields (2019)
  12. Bartoli, Daniele; Giulietti, Massimo; Montanucci, Maria: Linear codes from Denniston maximal arcs (2019)
  13. Bennett, Michael A.; Gherga, Adela; Rechnitzer, Andrew: Computing elliptic curves over (\mathbbQ) (2019)
  14. Brieulle, Ludovic; De Feo, Luca; Doliskani, Javad; Flori, Jean-Pierre; Schost, Éric: Computing isomorphisms and embeddings of finite fields (2019)
  15. Campbell, H. E. A.; Chuai, J.; Shank, R. J.; Wehlau, D. L.: Representations of elementary abelian (p)-groups and finite subgroups of fields (2019)
  16. Castillo-Ramirez, Alonso; McInroy, Justin; Rehren, Felix: Code algebras, axial algebras and VOAs (2019)
  17. Cerri, Jean-Paul; Lezowski, Pierre: Computation of Euclidean minima in totally definite quaternion fields (2019)
  18. Clark, Pete L.; Voight, John: Algebraic curves uniformized by congruence subgroups of triangle groups (2019)
  19. Cocke, William; Ho, Meng-Che: The probability distribution of word maps on finite groups (2019)
  20. Cossidente, Antonio; Marino, Giuseppe; Pavese, Francesco: The covering radius of (\mathrmPGL(3, q)) (2019)

1 2 3 ... 113 114 115 next

Further publications can be found at: