-
This completes in a fraction of a second:
```
sage: R.=PolynomialRing(QQ,order="lex")
sage: ideal(a^16,a-b^16,b-c^16,c-d^15).interreduced_basis()
[d^61440, c - d^15, b - d^240, a - d^3840]
```
I s…
-
Hello,
I believe I found a bug. I installed AlgebraicSolving as described on the website using
```
julia> using Pkg; Pkg.add("AlgebraicSolving")
```
The following script
```
using AlgebraicSo…
-
Maybe this is just due to differences on algorithms, but it may be interesting to think about the reason why there is a big performance difference on polynomial factorization among programs in the mar…
tueda updated
7 years ago
-
"There are too many changes going on at once, so that a merge in the end might be difficult. In order to avoid such difficulties and to keep an overview of things that are happening (for me and othe…
-
This was brought to my attention by @fieker. Apparently, this happens in particular for schemes. Hence, I cc @HechtiDerLachs , so we can discuss this at some point.
-
This is a meta-ticket for the [Google Summer of Code](https://summerofcode.withgoogle.com/programs/2022/projects/UpKWcuIO) project with the same name.
Tickets include:
- #32369 Rewrite Clifford an…
-
origin:
https://github.com/surface-smoothers/lipmanresolve/issues/284
newZero_decomp seems to expect redSB option and that is not documented.
Look at all newZero_decomp calls: shortly before the cal…
-
```
R := PolynomialRing(Rationals()); C := HyperellipticCurve(R![11, 64, 80, 40, 0, 4, 1], R![]);
Conductor_Genus2(C);
```
returns the following:
```
Conductor_Genus2(
C: Hyperell…
-
Here is a strategy for basis which I would have thought engine should already take advantage of:
Suppose $S$ is a multigraded ring with $S_0 = k$ and $M$ is an $R$-module which has some generators …
-
**Describe the bug**
It is unhelpful to print ``with elements...``: see the recorded output immediately below
```
Dict{MonomialOrdering, Oscar.IdealGens{QQMPolyRingElem}} with 1 entry:
degrevle…