Sage 3.0 Release Tour

Sage 3.0 was released on April 21st, 2008. For the official, comprehensive release notes, see the HISTORY.txt file that comes with the release. For the latest changes see sage-3.0.txt.

Random Numbers

Sage has a new random number framwork (by Carl Witty) with a global random number state, so that results using pseudo-random numbers can be reproducible. Randomized doctests are now actually tested, instead of having their results ignored. Use set_random_seed(n) to set a new random number seed, and initial_seed() to find the most recently set seed (or the seed set at Sage startup, if no new seed has been set). For much more information on the new random number framework, type sage.misc.randstate?.

GCC 4.3 Support

Sage 3.0 has full GCC 4.3 support, which means that every included package was fixed to compile with GCC 4.3 and the changes were pushed upstream.

New Default Binaries

Boolean Polynomials

The PolyBoRi library was updated to version 0.3.1 leading to greater stability and better performance. The interface to PolyBoRi was also improved and the documentation updated. Also the conversion to/from PolyBoRi, Singular and Magma was greatly improved.

Example Usage

   1 sage: sr = mq.SR(1,1,1,4,gf2=True) # create a small scale AES system
   2 sage: F,s = sr.polynomial_system()
   3 sage: P = F.ring() # polynomial ring
   4 sage: B = BooleanPolynomialRing(P.ngens(),P.variable_names(),order='lex') # quotient ring
   5 sage: IB = Ideal([B(f) for f in F]) # create ideal
   6 sage: IM = IB._magma_() # convert to Magma
   7 sage: IS = IB._singular_() # convert to Singular
   8 sage: gb = IS.groebner() 
   9 sage: P.change_ring(order='lex') == B.cover_ring()
  10 True

Modular Abelian Varieties

Sage now has support for computing with modular abelian varieties, including computing endomorphism rings, intersections, kernels of morphisms, etc., with complete documentation.

   1 sage: J = J0(389)
   2 sage: D = J.decomposition()
   3 sage: D
   4 [
   5 Simple abelian subvariety 389a(1,389) of dimension 1 of J0(389),
   6 Simple abelian subvariety 389b(1,389) of dimension 2 of J0(389),
   7 Simple abelian subvariety 389c(1,389) of dimension 3 of J0(389),
   8 Simple abelian subvariety 389d(1,389) of dimension 6 of J0(389),
   9 Simple abelian subvariety 389e(1,389) of dimension 20 of J0(389)
  10 ]
  11 sage: G, _ = D[4].intersection(D[0] + D[1] + D[2] + D[3])
  12 sage: G
  13 Finite subgroup with invariants [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 40, 40] over QQ of Simple abelian subvariety 389e(1,389) of dimension 20 of J0(389)

Increased Doctest Coverage

We dramatically increased our automated testing and example suite so that 51.5 % of functions have autotested examples. There are now nearly 60,000 lines of input examples. In February our testing was in the 30% range. This was a huge amount of work by many many Sage developers, and it has the practical impact that when you type foo? it is nearly twice as likely that you'll see a helpful example.

$ cd devel/sage/sage
$ ../../../sage -coverage .
Overall weighted coverage score:  51.5%
Total number of functions:  19514

R Pexpect Interface

There is now a new interface to R that uses a pseudotty; this is a completely different alternative to rpy, which makes it possible for the web-based Sage notebook to work as an R GUI, and also makes it so any R command can be used from Sage 100% exactly as in R. It is still clunky and has numerous issues, but it is fairly usable, documented, and has a test suite.



Laurent Polynomials


ReleaseTours/sage-3.0 (last edited 2009-12-26 14:42:39 by Minh Nguyen)