- 09 Apr 2011 15:37

**Release Notes:** Support was added for multivariate algebraic ring/field extensions using the ResidueRing class. JRuby and Jython versions and examples of the extension field builder were added. Small improvements and bug fixes were made for the latest Eclipse and Java 1.7 version.

- 18 Mar 2011 21:18

**Release Notes:** Easy to use construction of towers of extension fields in the class ExtensionFieldBuilder with methods for algebraic, transcendental, and real algebraic field extensions. Improvements in real and complex algebraic numbers. An improved polynomial parser for recursive representations. Small bugfixes.

- 18 Feb 2011 20:26

**Release Notes:** A HenselMultUtil class was added for multivariate Hensel lifting. It will be used in polynomial factorization in the future. Some parts of greatest common divisor now use multivariate Hensel lifting. The JAS source (r3408) compiles on Apache Harmony 6.0 (r991881). The unit tests pass with the exception of test cases involving object serialization.

- 09 Jan 2011 11:21

**Release Notes:** A new scripting interface with Ruby (JRuby) was added. Ruby allows rational number literals as p/q, which are better than the Python tuple form (p,q). Some toScript() methods were rewritten to reflect the Ruby language requirements and to differentiate between Ruby and Python. Exceptions for modular computations were made more precise to return also the discovered factors.

- 05 Jan 2011 23:46

**Release Notes:** The package structure was cleaned up and all cyclic package dependencies were removed. Factory parsing parts were split from GenPolynomialTokenizer to RingFactoryTokenizer. Some artificial code was required to use solvable polynomials as ring elements because solvable polynomials cannot implement RingElem<GenSolvablePolynomial<C>>. This resulted in cases of incorrect method dispatch for the multiply() method due to compiler optimizations. A workaround to detect and repair this is now implemented in the GenPolynomial class.

- 18 Dec 2010 11:33

**Release Notes:** New critial pair selection was implemented for Gröbner base computation with syzygy based algorithm after Gebauer and Möller in class OrderedSyzPairlist. Gröbner base classes were refactored to optionally use the new pair selection. Some JDK 1.6 constructs were back-ported to be compatible with JDK 1.5 again. Small improvements were made in Kronecker factor combination in the FactorAbstract class. A race condition in ThreadPool was fixed and termination detection was improved in Terminator. Fixes were made in parallel reduced Gröbner base computations. Univariate polynomial construction in Ideal was fixed.

- 28 Oct 2010 21:28

**Release Notes:** Multivariate Taylor series expansion interface and implementation. An improved multivariate power series for standard base computation. Methods have been refactored to better suited classes, and classes have been moved to decouple packages, e.g. Quotient* to the package edu.jas.ufd. Small bugs and cosmetic issues have been fixed.

- 18 Sep 2010 18:20

**Release Notes:** Multivariate power series in classes MultiVarPowerSeries and MultiVarPowerSeriesRing. Mora's tangent cone reduction algorithm and standard base computation for power series in package edu.jas.ps. Iterator over exponent vectors.

- 28 Aug 2010 10:08

**Release Notes:** This release features iterators for finite and some infinite structures, and the finite and infinite Cartesian products of them. Constructors were fixed to comply with the (new) Java memory model. There were also small bugfixes and improvements, more meaningful exceptions, and some renaming.

- 08 Aug 2010 10:18

**Release Notes:** The polynomial parser was improved to accept rational numbers denoted with decimal points and to accept BigDecimal coefficients. The use of the underscore for algebraic number coefficients in the polynomial parser was removed. Now every recursive call of parse() from a ring factory is triggered by braces which can be nested to any depth. A synchronization bug in solvable polynomial relation tables and a bug in parallel solvable polynomial Gröbner base were fixed. Unbounded thread pools are used to avoid dead-locks. Remaining parts were added for the factorization in polynomial rings of characteristic p > 0.