Change log for Magma V2.25-5 (Released 29/4/2020)

Algebraic Number Fields

·Determining whether an element of a number field is an nth power has been made more efficient. Reported by M. Grassl.

·Calculating a MaximalOrder given Discriminant or Ramification parameters has been improved. Reported by L. DembÃ©lÃ©.

Algebraic Number and Function Fields

·A bug in coercion of number field and function field elements into coefficient rings in a tower has been fixed. Reported by M. Grassl.

Coding Theory

·An error message for CyclicCode has been fixed to refer to the correct argument number. Reported by A. Previtali.

Commutative Algebra

·A bug in EquidimensionalPart has been fixed. Reported by G. Blanco.

Galois Groups

·A bug in GaloisGroup has been fixed. Reported by J. Barker and M. Soderholm.

Groups

·A crash when computing the soluble radical of a matrix group over a finite field has been fixed.

·The position of the second column when printing conjugacy classes or a subgroup lattice has been slightly modified in some cases.

·An bug in Centre for p-groups has been fixed. Reported by H. Dietrich.

I/O

·The undocumented intrinsics SetLinePrefix and GetIndentLevel have been removed.

·User indentation is no longer ignored if screen columns is 0, and may now exceed the screen columns.

·Fixed a bug with pipes on OS X, that could cause POpen to return a pipe that incorrectly re-used internal data of a previous POpen call. Reported by U. Thiel.

Maps

·Map application has been fixed so that automatic coercion into the domain is avoided when the input is a sequence of elements in the domain itself. Issue reported by G. Blanco.

Numerical Algebra

·A crash in NumericalSolution for non-trivial matrices has been fixed. Reported by D. Barth.

Polynomial Rings

·The &* operator, when applied to univariate polynomials of the same degree, has been sped up. Issue reported by M. Monagan.

·A bad slow-down in polynomial factorization over finite fields when there are a very large number of factors has been fixed. Reported by M. Monagan.

·The Shoup-based algorithm for polynomial factorization over finite fields has had some further speedups.

Representation Theory

·A crash in BrauerCharacter for trivial modules has been fixed.

Schemes

·It is now possible to construct a map between a projective scheme and an affine scheme with one of the defining polynomials being 0. Reported by A. Laface.