Re: Groebner bases over the integers
- From: "Philipp Ruemmer" <philipp@xxxxxxxxxxxxxx>
- Date: 3 May 2006 02:15:01 -0700
Hi,
you are completely right, computing over the rationals would make it
possible to reduce the polynomial y-x to 0. For the situation where I
want to simplify a formula
phi(y-x)
this would mean, however, that I have to carry out the reduction really
using rationals. From a practical point of view I would prefer not to
do that. Not that I would not see that the computation of bases and
reduction gets much simpler when using Q, I just expect loads of other
problems to pop up when I start using Q that I don't want to deal with
at this point.
In a similar situation, for instance,
phi(y)
I would end up with the expression
phi(-a/2)
although "-a/2" is known to range over the integers (given that "a" is
part of an integer solution of the equations "2*x+a=0, 2*y+a=0" and
hence even). I don't want to work with such "ill-shaped"/"badly-typed"
formulas.
Cheers, Philipp
.
- References:
- Re: Groebner bases over the integers
- From: Christopher Creutzig
- Re: Groebner bases over the integers
- Prev by Date: Re: divisors of zero
- Next by Date: Re: Groebner bases over the integers
- Previous by thread: Re: Groebner bases over the integers
- Next by thread: Re: Groebner bases over the integers
- Index(es):
Relevant Pages
|