[sage-devel] Re: advertisement for sage in dutch journal

2008-11-12 Thread Dan Drake
So I printed the lovely Sage advertisement and put it on my door. There was talk about making a more colorful version for a nice flyer or small poster; is there any progress on that front? I ask because I have some grant money which (near as I can tell) I have to spend on "clerical" expenses. Some

[sage-devel] Re: Inheritance

2008-11-12 Thread Robert Bradshaw
On Nov 12, 2008, at 1:35 AM, Nicolas M. Thiery wrote: > > Dear Mike, dear Robert B., > >> Mike: >> Maybe I'm just confused, but I'm not sure how the element >> hierarchy in >> your categories works with Cython. In particular, what do you see >> the >> inheritance tree looking like for

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Jason Grout
John H Palmieri wrote: > sage: scipy.linalg.det(a) > 0.0 > sage: scipy.linalg.inv(a) > > array([[ -4.50359963e+15, 9.00719925e+15, -4.50359963e+15], >[ 9.00719925e+15, -1.80143985e+16, 9.00719925e+15], >[ -4.50359963e+15, 9.00719925e+15, -4.50359963e+15]]) > sage: nump

[sage-devel] Re: segfault in graph planarity testing

2008-11-12 Thread Jason Grout
Jason Grout wrote: > I'm trying to track down a segfault in the graph planarity C code. Is > there anyone available who has seen the code in sage/graphs/planarity/ > who could jump on IRC and help? I'm not familiar with the code, so I'm > feeling a bit like I'm stumbling around in the dark.

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Jason Grout
mabshoff wrote: > > > On Nov 12, 4:28 pm, Jason Grout <[EMAIL PROTECTED]> wrote: >> John H Palmieri wrote: > > > >>> Oh, this is the problem. I'm running tcsh (I got used to it years >>> ago, and keep deciding it's too much work to switch). When I switch >>> to bash, everything works. >> I

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread John H Palmieri
> One more time, could you do the following sequence of commands so that I > can report them to the numpy mailing list.  I've left the output from my > run; it's interesting that the numpy.linalg.inv on my computer gives the > same ridiculous answers that your scipy.linalg.inv command gives.  It >

[sage-devel] Re: Binomial Ideals

2008-11-12 Thread Bjarke Hammersholt Roune
On Nov 12, 5:47 am, Martin Albrecht <[EMAIL PROTECTED]> wrote: > On Wednesday 12 November 2008, Thomas Kahle wrote: > Looks like: >    #include > is missing. > Yep, that is the case. I wonder if why my gcc didn't complain. Cheers, Bjarke --~--~-~--~~~---~--~~ To

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread mabshoff
On Nov 12, 4:28 pm, Jason Grout <[EMAIL PROTECTED]> wrote: > John H Palmieri wrote: > > Oh, this is the problem.  I'm running tcsh (I got used to it years > > ago, and keep deciding it's too much work to switch).  When I switch > > to bash, everything works. > > I get the same error (using ba

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Jason Grout
John H Palmieri wrote: > On Nov 11, 12:07 pm, mabshoff <[EMAIL PROTECTED]> wrote: >> On Nov 11, 12:02 pm, John H Palmieri <[EMAIL PROTECTED]> wrote: >> >> >> >>> On Nov 11, 11:57 am, Jaap Spies <[EMAIL PROTECTED]> wrote: John H Palmieri wrote: > On Nov 11, 4:24 am, mabshoff <[EMAIL PROTEC

[sage-devel] Re: Python complex number syntax, e.g., "2j"

2008-11-12 Thread William Stein
On Wed, Nov 12, 2008 at 9:06 AM, Jason Grout <[EMAIL PROTECTED]> wrote: > > Python supports creating complex numbers using the following syntax: > > imagnumber ::= (floatnumber | intpart) ("j" | "J") > > Right now, the preparser botches this and makes it give an error: > > sage: 1j > -

[sage-devel] Re: The Sage .spkg extension

2008-11-12 Thread Minh Nguyen
On Thu, Nov 13, 2008 at 3:23 AM, Tim Abbott <[EMAIL PROTECTED]> wrote: > > On Oct 28, 8:29 pm, "Minh Nguyen" <[EMAIL PROTECTED]> wrote: >> I won't do it right away because I want to know people's opinions >> about the issues contained in this thread. That is, I'm still awaiting >> the final resolu

[sage-devel] segfault in graph planarity testing

2008-11-12 Thread Jason Grout
I'm trying to track down a segfault in the graph planarity C code. Is there anyone available who has seen the code in sage/graphs/planarity/ who could jump on IRC and help? I'm not familiar with the code, so I'm feeling a bit like I'm stumbling around in the dark. Thanks, Jason --~--~

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Craig Citro
Actually, I have a numpy question, and since we're on the topic ... The following is somewhat frustrating: sage: R = RDF['x'] sage: f = R([4, 4, 1, 4, 2, 0, 1]) sage: f.roots(algorithm='pari') [(-1.0, 1), (-1.0, 1)] sage: f.roots() # uses numpy [] sage: import numpy sage: numpy.roots(f.reverse(

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Jason Grout
John H Palmieri wrote: > On Nov 12, 6:41 am, Jason Grout <[EMAIL PROTECTED]> wrote: >> John H Palmieri wrote: >>> an error in matrix_double_dense, which I couldn't find on trac (should >>> I create a ticket?): >>> sage -t devel/sage/sage/matrix/matrix_double_dense.pyx >>>

[sage-devel] Re: Question to Martin Albrecht

2008-11-12 Thread Michel
Thanks! I will think about your suggestions. I asked you since I know you are a cryptographer. I assume cryptographers know all about reversing hashes! Of course the question was in fact addressed to the whole list. Thanks again, Michel On Nov 12, 4:30 pm, Martin Albrecht <[EMAIL PROTECTED]

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread John H Palmieri
On Nov 12, 8:20 am, Jason Grout <[EMAIL PROTECTED]> wrote: > John H Palmieri wrote: > > On Nov 12, 6:41 am, Jason Grout <[EMAIL PROTECTED]> wrote: > >> John H Palmieri wrote: > >>> an error in matrix_double_dense, which I couldn't find on trac (should > >>> I create a ticket?): > > Yes, please cre

[sage-devel] Python complex number syntax, e.g., "2j"

2008-11-12 Thread Jason Grout
Python supports creating complex numbers using the following syntax: imagnumber ::= (floatnumber | intpart) ("j" | "J") Right now, the preparser botches this and makes it give an error: sage: 1j File "", line 1 Integer(1)j

[sage-devel] Re: The Sage .spkg extension

2008-11-12 Thread Tim Abbott
On Oct 28, 8:29 pm, "Minh Nguyen" <[EMAIL PROTECTED]> wrote: > I won't do it right away because I want to know people's opinions > about the issues contained in this thread. That is, I'm still awaiting > the final resolution. While I suspect that Sage will change the extension one day, it seems t

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Jason Grout
John H Palmieri wrote: > On Nov 12, 6:41 am, Jason Grout <[EMAIL PROTECTED]> wrote: >> John H Palmieri wrote: >>> an error in matrix_double_dense, which I couldn't find on trac (should >>> I create a ticket?): Yes, please create tickets for both of these errors. > sage: scipy.linalg.det(b) > 0.

[sage-devel] Re: Question to Martin Albrecht

2008-11-12 Thread Martin Albrecht
On Wednesday 12 November 2008, Michel wrote: > Ok that hint was not sufficient. > > What function(s) from the m4ri library would allow me to attack this > problem? > How do I express that the solution of the system is supposed to be > sparse > (which is a non-linear condition)? > As far as I can t

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread John H Palmieri
On Nov 12, 6:41 am, Jason Grout <[EMAIL PROTECTED]> wrote: > John H Palmieri wrote: > > an error in matrix_double_dense, which I couldn't find on trac (should > > I create a ticket?): > > > sage -t  devel/sage/sage/matrix/matrix_double_dense.pyx > >

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Jason Grout
John H Palmieri wrote: >> Expect some numerical noise doctest failures and some other related >> known issues. Please report issues here and check trac for existing >> tickets. > > On an intel mac running 10.5 (after changing my stone-age shell :), > sage -testall has two or three problems: > >

[sage-devel] Re: Binomial Ideals

2008-11-12 Thread mabshoff
On Nov 12, 2:47 am, Martin Albrecht <[EMAIL PROTECTED]> wrote: > On Wednesday 12 November 2008, Thomas Kahle wrote: > > > src/main.cpp: In function ‘int main(int, const char**)’: > > src/main.cpp:30: error: ‘srand’ was not declared in this scope > > Looks like: > >    #include > > is missing.

[sage-devel] Re: [sage-combinat-devel] Categories for the working programmer

2008-11-12 Thread koffie
> I guess the current implementation was deemed as temporary and to be > refactored; so not that useful to document right away at the user > level. Of course, the "final" implementation will need extensive > documentation. I actually expect the documentation to take out most of > the code and dev

[sage-devel] Re: [sage-combinat-devel] Categories for the working programmer

2008-11-12 Thread Nicolas M. Thiery
Dear category fans, First, thanks you so much for all the feedback you are kindly providing! I am busy right now with some articles + habilitation + visitors, but I am following the thread closely, and will answer soon where needed. On Tue, Nov 11, 2008 at 01:04:12AM -0500, Bill Page wr

[sage-devel] Re: Inheritance

2008-11-12 Thread Nicolas M. Thiery
Dear Mike, dear Robert B., > Mike: > Maybe I'm just confused, but I'm not sure how the element hierarchy in > your categories works with Cython. In particular, what do you see the > inheritance tree looking like for say ModuleElement since you want > that to be in Cython so that arithmet

[sage-devel] Re: Categories for the working programmer

2008-11-12 Thread Nicolas M. Thiery
On Mon, Nov 10, 2008 at 07:13:58PM -0800, Robert Bradshaw wrote: > If I understand your code correctly, what you're proposing is that to > declare an Parent/Element to be a member of a category, one creates > the category and then dynamically creates classes at runtime that > need to be inhe

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Craig Citro
Hi all, So there's one annoying new problem with rc0, and it's partly my fault. Here's the issue: if you do a fresh build, and then clone, it's going to do a sage -ba. The underlying problem is coming from the way trac #4500 (which is a genuine bug) interacts with our new build system. I'll fix i

[sage-devel] Re: Question to Martin Albrecht

2008-11-12 Thread Michel
Ok that hint was not sufficient. What function(s) from the m4ri library would allow me to attack this problem? How do I express that the solution of the system is supposed to be sparse (which is a non-linear condition)? As far as I can tell there is no real reference manual for m4ri. Regards, Mi

[sage-devel] Re: Binomial Ideals

2008-11-12 Thread Martin Albrecht
On Wednesday 12 November 2008, Thomas Kahle wrote: > src/main.cpp: In function ‘int main(int, const char**)’: > src/main.cpp:30: error: ‘srand’ was not declared in this scope Looks like: #include is missing. Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/look

[sage-devel] Re: Sage 3.2.rc0 released

2008-11-12 Thread Jaap Spies
mabshoff wrote: > Hello folks, > > Sources and a sage.math only binary can be found at > > http://sage.math.washington.edu/home/mabshoff/release-cycles-3.2/ > On Fedora 8, 32 bits one test failure: [EMAIL PROTECTED] sage-3.2.rc0]$ ./sage -t devel/sage/sage/combinat/species/library.py sage

[sage-devel] Re: Question to Martin Albrecht

2008-11-12 Thread Michael Brickenstein
http://m4ri.sagemath.org/performance.html On 12 Nov., 11:07, Michel <[EMAIL PROTECTED]> wrote: > > If the equations are really linear, then it's trivial. > > Ah, can you tell me more? > > Regards, > Michel --~--~-~--~~~---~--~~ To post to this group, send email to

[sage-devel] Re: Question to Martin Albrecht

2008-11-12 Thread Michel
> If the equations are really linear, then it's trivial. > > Ah, can you tell me more? Regards, Michel --~--~-~--~~~---~--~~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more

[sage-devel] Re: Question to Martin Albrecht

2008-11-12 Thread Michael Brickenstein
Hi! What do you mean by the word "linear": x+y+z+1 (which is the normally considered as linear and inhomogeneous). or something like deg bound 1 per variable: x*y*z+1 If the equations are really linear, then it's trivial. On 12 Nov., 09:03, Michel <[EMAIL PROTECTED]> wrote: > Hmm this question i

[sage-devel] Re: Binomial Ideals

2008-11-12 Thread Thomas Kahle
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 Hi Bjarke, thank you for your fast response. I will come back to you when it is clear to me which monomial computations I need. > It would be useful if you could identify the specific computations you > need to do on monomial ideals, and what specif

[sage-devel] Re: Question to Martin Albrecht

2008-11-12 Thread Michel
Hmm this question is going to have (too) many solutions: Take any solution with 781-64 arbitrarily assigned zeros. Chances are big that this solution has at most 38 ones. What if we replace 38 by a smaller number. Say 20? Michel On Nov 12, 8:43 am, Michel <[EMAIL PROTECTED]> wrote: > Hi, > >