Re: [sage-support] Fwd: sage q

Note also that there is not just one but many embeddings of GL(8, GF(2)) into GL(10, GF(2)), and I'm not convinced that any of them is more natural than the others -- there is even more than one diagonal embedding. So I'm not sure this is a well-defined question (but maybe I'm misinterpreting wha

[sage-support] Re: SAGE and .NET interoperability.

dfg wrote: > Is this possible and, if yes, could you please explain how this can be > done or point me in the right direction? > Is it possible that you could use Sympy? Does Sympy run on IronPython, which presumably is easier to use from .NET? Thanks, Jason -- To post to this group, se

[sage-support] region plot error

When I try the following: sage: x,y = var('x,y') sage: region_plot(1/x + 1/y > 1/x * 1/y, (x,-10,10), (y,-10,10)).show () I get an error (the last line of the Traceback is reproduced below): TypeError: reduce() of empty sequence with no initial value This error occurs in both the notebook and

Re: [sage-support] SAGE and .NET interoperability.

On Thu, Dec 31, 2009 at 2:01 PM, dfg wrote: > Hi there, > > I have a C# (4.0) program which, at some point, needs to calculate > partial derivatives of arbitrary order of some functions. To do this > the old fashioned way (loops and the like) has turned into horror code > and a nightmare to test.

[sage-support] SAGE and .NET interoperability.

Hi there, I have a C# (4.0) program which, at some point, needs to calculate partial derivatives of arbitrary order of some functions. To do this the old fashioned way (loops and the like) has turned into horror code and a nightmare to test. To do it numerically doesn't make the code much easier t

[sage-support] Re: A ring of exponentials

Burcin, Thanks. That sounds a lot like what I'm looking for. I'd be interested in it. And, I'm sure that I'm not alone in saying that even if it's inefficient it might be worthwhile making an optional spkg for it. Victor On Dec 31, 3:42 pm, Burcin Erocal wrote: > Hi, > > On Thu, 31 Dec 2009 0

Re: [sage-support] A ring of exponentials

Hi, On Thu, 31 Dec 2009 08:37:55 -0800 (PST) VictorMiller wrote: > Is there any easy way of building up what I'd call a ring of > exponentials (maybe there's a better word)? For example I'd like to > work in the ring QQ[[2^j for j in Integers()]]: the ring with > coefficients in Q and elements

Re: [sage-support] arbitrary precision arithmetic by default

On Thu, Dec 31, 2009 at 10:13 AM, eliot brenner wrote: > Is there a way to make all floating point calculations within a > program or session occur to a fixed precision, say 500 digits?  I know > how to  issue commands like > > R500 = RealField(500) #set up 500 bit precision arithmetic > R500(pi)

Re: [sage-support] arbitrary precision arithmetic by default

On Thu, Dec 31, 2009 at 12:13 PM, eliot brenner wrote: > Is there a way to make all floating point calculations within a > program or session occur to a fixed precision, say 500 digits?  I know > how to  issue commands like > > R500 = RealField(500) #set up 500 bit precision arithmetic > R500(pi)

[sage-support] arbitrary precision arithmetic by default

Is there a way to make all floating point calculations within a program or session occur to a fixed precision, say 500 digits? I know how to issue commands like R500 = RealField(500) #set up 500 bit precision arithmetic R500(pi) etc. for an individual calculation. But it would be preferable t

Re: [sage-support] Fwd: sage q

Ciaran, You should probably write to the GAP support forum: http://www.gap-system.org/Contacts/People/supportgroup.html On Thu, Dec 31, 2009 at 9:05 AM, Martin Albrecht wrote: > Any takers? > > Cheers, > Martin > --  Forwarded Message  -- > Subject: sage q > Date: Thursday 31

Re: [sage-support] Re: Need help in starting a sage server

On Thu, Nov 19, 2009 at 8:26 AM, William Stein wrote: > On Thu, Nov 19, 2009 at 3:33 AM, John Cremona wrote: >> I am having exactly the same problem as the original poster.  The >> machine runs 64-bit ubuntu (Linux version 2.6.28-13-generic >> (bui...@yellow) (gcc version 4.3.3 (Ubuntu 4.3.3-5ubu

[sage-support] Fwd: sage q

Any takers? Cheers, Martin -- Forwarded Message -- Subject: sage q Date: Thursday 31 December 2009 From: Ciaran Mullan To: m.r.albre...@rhul.ac.uk Hi Martin, Happy new year! I have a yet another basic sage question: G=GL(10,GF(2)) H=GL(8,GF(2)) G contains a subgroup K isomo

Re: [sage-support] PolyBori

On Thursday 31 December 2009, wael tawah wrote: > Hi, > > I'd like to know > > how could I use PolyBori to obtain a Groebner basis for a set of > multivaliate polynomials? Hi, see http://sagemath.org/doc/reference/sage/rings/polynomial/pbori.html > how can I obtain the memory used for thi

[sage-support] A ring of exponentials

Is there any easy way of building up what I'd call a ring of exponentials (maybe there's a better word)? For example I'd like to work in the ring QQ[[2^j for j in Integers()]]: the ring with coefficients in Q and elements 2^j where j is an integer (or possibly just a non-negative integer). Such t

[sage-support] Re: Can SAGE perform "raising to a p^th power" quicker in char p?

On Dec 30, 9:46 pm, Alex P wrote: > I was trying to figure out if SAGE can raise to the pth power quickly > in characteristic p. It seems that it doesn't. Am I right to think > that or am I missing something? Here is what led me to this See also (a

[sage-support] PolyBori

Hi, I'd like to know how could I use PolyBori to obtain a Groebner basis for a set of multivaliate polynomials? how can I obtain the memory used for this computation? Best Regards wael -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send e

[sage-support] Re: Can SAGE perform "raising to a p^th power" quicker in char p?

On Dec 31, 12:46 am, Alex P wrote: > I was trying to figure out if SAGE can raise to the pth power quickly > in characteristic p. It seems that it doesn't. Am I right to think > that or am I missing something? Here is what led me to this > > [snip] See also: http://groups.google.com/group/sage

Re: [sage-support] Can SAGE perform "raising to a p^th power" quicker in char p?

On Dec 30, 2009, at 9:46 PM, Alex P wrote: > I was trying to figure out if SAGE can raise to the pth power quickly > in characteristic p. It seems that it doesn't. Am I right to think > that or am I missing something? No, there's nothing (as far as I know) that takes advantage of the characteri