-
An implementation of ideals and subalgebras generated by a subset of a finite dimensional Lie algebra with basis. In the finite dimensional case a naive (and probably inefficient) method of repeated…
-
The new aim of this ticket is to add an interface to the [letterplace](http://www.singular.uni-kl.de/Manual/latest/sing_427.htm#SEC480) component of Singular, that actually goes beyond what Singular…
-
The build of the GUI (`xcas`) has been disabled in the `spkg-install` to minimize the dependencies.
**Sage packages**:
* [http://webusers.imj-prg.fr/~frederic.han/xcas/sage/giac-1.2.0.13.tar.gz](ht…
-
PolyBoRi is a framework for doing computation within the boolean ring, i.e. the ring
```
F_2[x_1,...,x_n]/
```
From the benchmarks presented in http://www.itwm.fraunhofer.de/zentral/download/berich…
-
A way of estimating the complexity of Gröbner basis computations for random systems is to consider the degree of regularity as an upper bound for the degree which will be reached. Thus, it might be …
-
*Attachments*
Please only use the attachment 'SymmetricIdeals.patch' and disregard the other attachments (I don't know how to delete them. It should apply to `sage-3.4.1.rc2`.
**Symmetric Ideals** …
-
Reduction modulo ideals in quotient rings does not return unique minimal representatives.
In this example, the ideal `J` in the quotient ring `Q = R/I` contains the element `t^2 - z^2`, so `reduce`…
-
(Duplicate of #12188)
The following returns the right thing in the end, but exhibits a problem with calling Singular in the process:
```
sage: K. = FunctionField(QQ)
sage: A. = PolynomialRing(K, 2…
-
```
A. = QQ[]
Gauss. = A.quotient(x^2+1)
R. = Gauss[]
S = R.quotient([(X1^2+Y1^2)*Z1^2-c^2*(Z1^4+d*X1^2*Y1^2),
(X2^2+Y2^2)*Z2^2-c^2*(Z2^4+d*X2^2*Y2^2)])
S(1)
```
Produces the tr…
-
```
2009/04/06 The first release candidate of PolyBoRi 0.6 is available
for download. It comes with a PEP8-conforming python interface and
new algorithms: FGLM and (experimental) parallel process…