Rings changelog

Changelog History

• v2.5.7 Changes

  December 14, 2019

  🛠 Bugfix for #66

• v2.5.6 Changes

  December 13, 2019

  🛠 Bugfix for #65

• v2.5.5 Changes

  November 26, 2019

  🛠 Bugfix for #63

• v2.5.4 Changes

  November 17, 2019

  🛠 Fixed bug (#a668655) in Newton polygon method which caused wrong irreducibility test for bivariate polynomials.

• v2.5.3 Changes

  September 11, 2019

  🐛 Bug fixes and small improvements:

  • ➕ added possibility to cache all modular inverses for small finite fields (#59)
  • switched to libdivide4j v1.2
  • 🛠 compatibility fixes with Java 12
  • 🛠 fix #60

• v2.5.2 Changes

  September 16, 2018

  🛠 Bugfix release:

  • 🛠 bugfixes in rational functions #45 #46 #49
  • 🛠 fix performance dip of multivariate gcd for equal polynomials 1e6936a
  • 🛠 fix some bad cases for univariate factorization over Z #47 (todo: implement LLL based van Hoeij's algorithm in future)
  • 🛠 fix #48

• v2.5.1 Changes

  July 29, 2018

  🛠 Bugfix release:

  • 🛠 minor bugfix in LeinartDecomposition
  • 🛠 minor bugfix in bivariate MultivariateFactorization
  • 👍 better Scala API for GroebnerMethods
  • 🛠 other small fixes & improvements
  • ➕ added -V option to rings.repl (specify Rings version)

• v2.5 Changes

  July 24, 2018

  👍 This version introduces rigorous support of algebraic number fields and general field extensions (#43):

  • ✅ Implementation of algebraic number fields (AlgebraicNumberField) via simple (SimpleFieldExtension) and multiple (MultipleFieldExtension) field extensions
  • 👍 Fully support polynomial GCD, resultants and factorization over algebraic number fields
  • Methods for constructing splitting fields (SplittingField(poly))

  Various methods from theory of resultants:

  • ✅ Implementation of different univariate polynomial remainder sequences, subresultant sequences, resultants and discriminants over arbitrary fields (UnivariateResultants)
  • ✅ Efficient multivariate resultants and discriminants over arbitrary fields by adapting Brown's and Zippel's algorithms for GCD (MultivariateResultants)

  ✅ Methods related to Groebner bases (GroebnerMethods):

  • Special elimination methods GroebnerMethods.eliminate(polys, variable)
  • ✅ Methods for testing algebraic dependence of polynomials and computing algebraic relations (annihilators) GroebnerMethods.algebraicRelations(polys)
  • Computation of Nullstellensatz certificates GroebnerMethods.NullstellensatzCertificate(polys)
  • Leinart's partial fraction decomposition of multivariate fractions (GroebnerMethods.LeinartDecomposition(fraction))

• v2.4 Changes

  May 04, 2018

  Two major improvements:

  • 👌 improved mathematical expressions IO (#38)
  • vastly improved implementation of rationals, including rational function arithmetic (#39)
  • 🛠 minor fixes and improvements

• v2.3.2 Changes

  April 16, 2018

  📜 Important bug fix that caused fail of sparse Hensel lifting in many cases.