Re: [sage-support] Re: how to enlarge memory limits

Am 2014-08-12 um 17:42 schrieb Nils Bruin: > On Tuesday, August 12, 2014 7:29:01 AM UTC-7, Daniel Krenn wrote: > (, 28257) > > > This could be a large number (although expressions are recursive data > structures, so one complicated expression can cause a lot of them to > exist). I'm using a

Re: [sage-support] Re: how to enlarge memory limits

Am 2014-08-13 um 08:18 schrieb Dima Pasechnik: > On 2014-08-12, Nils Bruin wrote: >> --=_Part_5256_754630738.1407883007654 >> Content-Type: text/plain; charset=UTF-8 >> >> On Tuesday, August 12, 2014 7:29:01 AM UTC-7, Daniel Krenn wrote: >>> >>> >>> It doesn't look like the results above help

[sage-support] Re: how to enlarge memory limits

On 2014-08-12, Nils Bruin wrote: > --=_Part_5256_754630738.1407883007654 > Content-Type: text/plain; charset=UTF-8 > > On Tuesday, August 12, 2014 7:29:01 AM UTC-7, Daniel Krenn wrote: >> >> >> It doesn't look like the results above help (but maybe I just interpret >> them wrongly) >> >> Pos

[sage-support] Re: x or y dot?

Is it possible with sage to use some type of shorthand notation to > denote the first or second time derivative? > > Hi, That's a good question, but Sage does not currently support the greatest short notation for derivatives, either differential-style or fluxion-style. The problem is the am

[sage-support] x or y dot?

Is it possible with sage to use some type of shorthand notation to denote the first or second time derivative? Thanks, Chris -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send

Re: [sage-support] Re: how to enlarge memory limits

On Tuesday, August 12, 2014 7:29:01 AM UTC-7, Daniel Krenn wrote: > > > It doesn't look like the results above help (but maybe I just interpret > them wrongly) > > Possible fix now on: http://trac.sagemath.org/ticket/16809 -- You received this message because you are subscribed to the Google G

[sage-support] Re: Quotient ring over Finite Field 2^n

Hi Peter, Your solution can be used in some applications. However, I guess the "call" is more natural and understandable. It can be also used in the following: K = GF(2^8, 'a') P. = PolynomialRing(K) Q. = P.quotient_ring(x^256 - x) f = Q.random_element() f.subs(Q.random_element()) Albeit... K

[sage-support] Re: Quotient ring over Finite Field 2^n

Hello, It seems like quotient_ring doesn't have '__call__'. Does it a bug or a > feature? > > sage: K = GF(2^8,'a') > sage: P = PolynomialRing(K,'x') > sage: Q = P.quotient_ring(P("x^256+x"),'y') > sage: f = Q.random_element() > sage: f.subs(y=K.random_element()) # random > (a^7 + a^6 + a^3 + a)*

[sage-support] Re: Crash report for sagemath 5.8 & Failed to build sagemath 6.2

Looks like your build environment has some environment variables set that conflict with libtool. Also, look at the config.log. On Tuesday, August 12, 2014 9:03:05 PM UTC+1, Nick Paulin wrote: > > I am still haveing problems with sage 6.2 on Chakra. I have tried the > PKGBUILD from arch, aur, a

[sage-support] Re: Overflow creating finite field element

Hello, I seem to have run across a potential bug on Sage: > > p = previous_prime(2^64) >> F. = GF(p^2) >> x * 2**63 >> >> > throws a "overflow in t_INT-->long assignment" exception creating the > element x * 2**63. > This is indeed a bug. Sage calls the wrong PARI function for this conversion:

[sage-support] Re: Crash report for sagemath 5.8 & Failed to build sagemath 6.2

I am still haveing problems with sage 6.2 on Chakra. I have tried the PKGBUILD from arch, aur, and Chakra's git repository. The logs and bug report on the bug tracking system are located here: http://chakraos.org/forum/viewtopic.php?id=13221 http://chakraos.org/bugtracker/index.php?do=details&

[sage-support] Re: Strangeness in complex plotting

Trac#16804 created. It seems (see second example in the ticket) that pure imaginary (i. e. real(x)==0) are plotted without problem. HTH, -- Emmanuel Charpentier Le mardi 12 août 2014 15:26:34 UTC+2, kcrisman a écrit : > > sage: points(map(lambda x

Re: [sage-support] Re: how to enlarge memory limits

On Tuesday, August 12, 2014 7:29:01 AM UTC-7, Daniel Krenn wrote: > (, 2175) > (, 8563) Numbers of course depend on the context, but this doesn't look alarming. You can probably check yourself if you expect the number of RIF and CIF elements to be of this order. They certainly wouldn't keep a

Re: [sage-support] Re: how to enlarge memory limits

Am 2014-08-11 um 16:19 schrieb Nils Bruin: > On Monday, August 11, 2014 4:46:45 AM UTC-7, Daniel Krenn wrote: > As expected. If you want to get some idea of what is taking memory at > the sage side you could do something like > > import gc > from collections import Counter > gc.collect() > pre={i

Re: [sage-support] Question about SAT solver

This is a bug. In particular: sage: S.solve(eliminate_linear_variables=False) [{w: 0, z: 0, y: 0, x: 0}] Does the trick. The bug is that eliminating linear variables already solves the problem and the logic in solve() doesn't handle this case. Please open a ticket and CC me. On Tuesday 12 Aug

[sage-support] Re: Strangeness in complex plotting

> > sage: points(map(lambda x:x[0].N(),(z^20+1).roots()), figsize=4, > aspect_ratio=1) > > > These are all "complex". > > sage: points(map(lambda x:x[0].N(),(z^20-1).roots()), figsize=4, > aspect_ratio=1) > map(lambda x:x[0].N(),(z^20-1).roots()) [0.951056516295154 + 0.309016994374947*I, 0

Re: [sage-support] emacs' sage_mode no longer typesets in 6.2 (Linux)

Le mardi 12 août 2014 03:25:35 UTC+2, Ivan Andrus a écrit : > > I’m not sure I understand. What do you mean when you say there is no > debugging? A recipe for what used to work and doesn’t now would be great. > Wekk, for oe thng, you can't trace a call : [ In emacs ] sage: sage: def fact(n

[sage-support] Strangeness in complex plotting

This I don't understand : sage: var("z") z sage: points(map(lambda x:x[0].N(),(z^20+1).roots()), figsize=4, aspect_ratio=1) [ Gives the expected result (enclosed) ] sage: points(map(

[sage-support] Question about SAT solver

Dears members, I'm trying to understand why the solver not found solution in this code R. = BooleanPolynomialRing() S = PolynomialSequence([x*y+z,x+y]) sol = S.solve(); sol [] For me the solution is x=1;y=1 and z=1, or I'm wrong? thanks -- -

Re: [sage-support] Cryptominisat Error

Hello, Try "sage -b" Vincent 2014-08-12 10:25 UTC, Juan Grados : > Dear members, > > I'm installed the cryptominisat solver using: ./sage -i > cryptominisat-2.9.6 in Sage Version 6.2, Release Date: 2014-05-06 on Ubuntu > 14.04 LTS but when I trying to execute the command > > from sage.sat.solver

[sage-support] Cryptominisat Error

Dear members, I'm installed the cryptominisat solver using: ./sage -i cryptominisat-2.9.6 in Sage Version 6.2, Release Date: 2014-05-06 on Ubuntu 14.04 LTS but when I trying to execute the command from sage.sat.solvers.cryptominisat import CryptoMiniSat I get the error: Traceback (most recent c