1
vote
2answers
205 views

CAS for algebraic geometry, which one?

I use Maple to compute Groebner bases and find it very efficient/fast for my current needs. However, several introductory textbooks on algebraic geometry refer to Singular, which I never used before. ...
2
votes
1answer
109 views

How to extract the indeterminates from a set of polynomial?

I am a biologist and I am facing a huge problem. I would like to extract the indeterminates of a set of polynomials, for example, I have: $f_{1} = \{\\x_{3}^{2} + x_{1}*x_{2} + x_{1} + x_{1}*x_{3},\\ ...
1
vote
0answers
71 views

Looking for a binomial system solver

I am interested in solving binomial systems of the form $$ \begin{cases} a_1 x_1^{d_{11}} x_2^{d_{12}} \cdots x_n^{d_{1n}} + b_1 x_1^{d_{11}} x_2^{d_{12}} \cdots x_n^{d_{1n}} &= 0 \\ ...
2
votes
1answer
209 views

Simple generators with a complex Gröbner basis

It's known that finding a Gröbner basis of a polynomial ideal has a worst-case space complexity of $O(2^{2^{c\cdot n}})$, where c is constant and n is the number of variables $k[x_1,\ldots,x_n]$. ...
7
votes
1answer
147 views

Why is $\operatorname{res}(fg,h)=\operatorname{res}(f,h)\cdot\operatorname{res}(g,h)$, where $\operatorname{res}$ stand for resultant?

I'm learning Computer Algebra and met an exercise asking me to prove that $$ \operatorname{res}(fg,h)=\operatorname{res}(f,h)\cdot\operatorname{res}(g,h) $$ where $f(x)$, $g(x)$ and $h(x)$ are ...
2
votes
1answer
654 views

Solving a nonlinear system using Groebner basis computations

I have discovered that Groebner basis computations may help in a problem I am working on. However, I am having some very specific problems. First, the literature I have discovered on Groebner basis ...