|
Size: 353
Comment: add some more new features
|
Size: 975
Comment: Added description of Frobby
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 9: | Line 9: |
| == Frobby == | == Frobby for monomial ideals (Bjarke Hammersholt Roune) == Frobby is software for computations with monomial ideals, and is included in Sage 3.0.2 as an optional spkg. The current functionality of the Sage interface to Frobby is irreducible decomposition of monomial ideals, while work is on-going to expose more of the capabilities of Frobby, such as Hilbert-Poincare series, primary decomposition and Alexander dual. Frobby is orders of magnitude faster than other programs for many of its computations, primarily owing to an optimized implementation of the Slice Algorithm. See [http://www.broune.com/frobby/] for more on Frobby. |
Sage 3.0.2 Release Tour
Sage 3.0.2 was released on May 24th, 2008. For the official, comprehensive release notes, see the HISTORY.txt file that comes with the release. For the latest changes see [http://sagemath.org/announce/sage-3.0.2.txt sage-3.0.2.txt].
linear codes (Robert Miller)
Posets and Semi-Lattices
Frobby for monomial ideals (Bjarke Hammersholt Roune)
Frobby is software for computations with monomial ideals, and is included in Sage 3.0.2 as an optional spkg. The current functionality of the Sage interface to Frobby is irreducible decomposition of monomial ideals, while work is on-going to expose more of the capabilities of Frobby, such as Hilbert-Poincare series, primary decomposition and Alexander dual. Frobby is orders of magnitude faster than other programs for many of its computations, primarily owing to an optimized implementation of the Slice Algorithm. See [http://www.broune.com/frobby/] for more on Frobby.