On Dec 6, 3:04 am, Carl Witty <[EMAIL PROTECTED]> wrote:
> On Dec 5, 4:17 pm, Robert Miller <[EMAIL PROTECTED]> wrote:
>
> > Does anyone have any thoughts on the following? Luke Wolcott showed me
> > this example- the traceback looks suspect, but I don't know about the
> > internals here. Is this just something that is too big?
>
> Just for fun, I took a look at what the code is doing. (I don't know
> the math here, so I can't tell whether the problem is too big or the
> code is buggy.)
>
> The call to monomials() from relative_order_from_ring_generators() is
> going to create a list of 3^20 elements (about 3.5 billion elements).
> Each element is a univariate polynomial with up to 240 terms, where
> the coefficients are rationals with numerators and denominators of up
> to about 240 digits. (Only about 4.7 million of the list elements are
> actually this big.)
>
> Carl Witty
I ran the computation on sage.math and killed it after about 30
minutes when it was using 20+ GB Ram. So I assume that Luke's computer
ran out of RAM. At that point Carl had told me about the numbers
above :)
Cheers,
Michael
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~----------~----~----~----~------~----~------~--~---
