Re: Groebner bases over the integers
- From: Christopher Creutzig <christopher@xxxxxxxxxxx>
- Date: Tue, 02 May 2006 17:21:49 +0200
Philipp Ruemmer wrote:
2*x+a, 2*y+a
this would already be the reduced Groebner basis over Q (for the
lexicographic ordering with y>x>a), modulo the factors 1/2.
And your example y-x reduces to 0 wrt this basis. If a polynomial is zero for all integers, it's zero for all rationals as well (and, obviously, vice versa).
Regards,
Christopher
.
- Follow-Ups:
- Re: Groebner bases over the integers
- From: Philipp Ruemmer
- Re: Groebner bases over the integers
- Prev by Date: Re: divisors of zero
- Next by Date: Re: divisors of zero
- Previous by thread: Re: The VM machine presents yet another freshman's level Maple bug [limit/assume]
- Next by thread: Re: Groebner bases over the integers
- Index(es):
Relevant Pages
|