Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.math.symbolic    |    Symbolic algebra discussion    |    10,432 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 9,568 of 10,432    |
|    bursejan@gmail.com to All    |
|    =?UTF-8?Q?Re=3A_Test_Cases_for_Gr=C3=B6b    |
|    11 Jul 17 14:43:37    |
      What I agree so far is, the Bezouts identity might       be a problem. But I didn't not yet see a striking       multivariate application of it.              To the best of my knowledge a great deal of reduction       tasks can be done with GB. GB is especially suited       for this task. But isn't this a side track?              A side track in the sense that it drifts away       from the GCD domain GCD computation task, which       is at stake in this thread,              respectively any fast GB will also deliver fastly       such a GCD in the domain K[X1,..,Xn]. This is the       problem statement, fast GB, nice to hear that CAS              also solves other problems, but a little off topic.              Am Dienstag, 11. Juli 2017 23:35:50 UTC+2 schrieb burs...@gmail.com:       > So whats the status of the R. Fateman conjecture as of now?       > Except for the domain blow? Well not much has happened since.       > RJF still shows his ability to play the fool.       >       > His current strategy is not to fool around Euclid GCD, but       > to fool around division algorithms (Euclid, non-Euclid Reduction)       > etc.. Whats next, fooling around about the arabic zero?       >       > Will we see a pamphlet posted by RJF, that claims there       > is no arabic zero, and hence GB for GCD is nonsense. Who       > knows, I am currious, what the next steps will be by       >       > RJF, to avoid a substantiation of his conjecture. So far       > we could only read nonsense. Not a single qualitative       > argument so far, but the conjecture was clearly       >       > originally started as a qualitative quest, i.e. performance       > of algorithm. Is this a joke now, changing the topic to       > some dunno what properties of CAS systems?       >       > Stay on topic RJF, and please substantiate your claims.       >       > Am Dienstag, 11. Juli 2017 23:26:44 UTC+2 schrieb burs...@gmail.com:       > > But maxima has also a GB library, so what are you bragging about?       > > Could it be that you belong to the sort of highly confused fellas?       > > I recommend reading a book once a while, for example:       > >       > > David Cox; Little, John; O'Shea, Donald:       > > Ideals, varieties, and algorithms.       > > New York: Springer-Verlag, 1997       > >       > > So that you know what we are talking about here.       > >       > > Am Samstag, 8. Juli 2017 18:02:03 UTC+2 schrieb Richard Fateman:       > > > On 7/8/2017 5:05 AM, bursejan@gmail.com wrote:       > > > > I have to retract my criticsm in as far that algorithm       > > > > C indeed has some aspects that might make it sometimes work.       > > > > I am still looking for the example where it breaks.       > > > >       > > > Maybe in the future when someone offers you advice in private       > > > email, you will think twice before insisting that the discussion       > > > be carried on in a newsgroup.       > > >       > > > Have a good weekend.       > > > RJF              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca