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 3296 articles , 5 standard articles )

Showing results 3121 to 3140 of 3296.
Sorted by year (citations)

previous 1 2 3 ... 155 156 157 158 159 ... 163 164 165 next

  1. Holt, Derek F.; Walton, Jacqueline: Representing the quotient groups of a finite permutation group (2002)
  2. Howe, Everett W.; Zhu, Hui June: On the existence of absolutely simple abelian varieties of a given dimension over an arbitrary field (2002)
  3. Kemper, Gregor: The calculation of radical ideals in positive characteristic (2002)
  4. Kilford, L. J. P.: Some non-Gorenstein Hecke algebras attached to spaces of modular forms. (2002)
  5. Klappenecker, Andreas; Rötteler, Martin: Beyond stabilizer codes. I: Nice error bases (2002)
  6. Lecerf, G.: Quadratic Newton iteration for systems with multiplicity (2002)
  7. Leedham-Green, C. R.; O’Brien, E. A.: Recognising tensor-induced matrix groups. (2002)
  8. Lomonaco jun., Samuel J.; Kauffman, Louis H.: Quantum hidden subgroup algorithms: a mathematical perspective (2002)
  9. Lübeck, Frank: On the computation of elementary divisors of integer matrices (2002)
  10. Lucks, Stefan: A variant of the Cramer-Shoup cryptosystem for groups of unknown order (2002)
  11. Marušič, Dragan; Potočnik, Primož: Bridging semisymmetric and half-arc-transitive actions on graphs (2002)
  12. Rains, E. M.; Sloane, N. J. A.; Stufken, John: The lattice of (N)-run orthogonal arrays (2002)
  13. Shank, R. James; Wehlau, David L.: Noether numbers for subrepresentations of cyclic groups of prime order. (2002)
  14. Shank, R. James; Wehlau, David L.: Computing modular invariants of (p)-groups. (2002)
  15. Steel, Allan: A new scheme for computing with algebraically closed fields (2002)
  16. Steinwandt, Rainer; Geiselmann, Willi; Endsuleit, Regine: Attacking a polynomial-based cryptosystem: Polly Cracker (2002)
  17. van Hoeij, Mark: Factoring polynomials and the knapsack problem (2002)
  18. Wocjan, P.; Rotteler, M.; Janzing, D.; Beth, T.: Universal simulation of Hamiltonians using a finite set of control operations (2002)
  19. Adem, A.; Carlson, J. F.; Karagueuzian, D. B.; Milgram, R. James: The cohomology of the Sylow 2-subgroup of the Higman-Sims group (2001)
  20. Adem, Alejandro; Gao, Wenfeng; Karagueuzian, Dikran B.; Mináč, Ján: Field theory and the cohomology of some Galois groups (2001)

previous 1 2 3 ... 155 156 157 158 159 ... 163 164 165 next

Further publications can be found at: