From: "Bill Hart" <[EMAIL PROTECTED]>
> 5) Rewrite the x86 assembly to use NASM (possibly FASM, but there is
> a
> bootstrapping issue with the source code for that, NASM is written in
> C, so no bootstrapping problems there).
> Q. What about Apple and Microsoft support?
>
> A. We want to suppor
On May 8, 12:37 pm, Timothy G Abbott <[EMAIL PROTECTED]> wrote:
> When I try to connect tohttp://wiki.sagemath.org/from various IP
> addresses, I get the following error:
>
> "Warning: You triggered the wiki's surge protection by doing too many
> requests in a short time. Please make a short bre
On May 8, 12:25 pm, Timothy G Abbott <[EMAIL PROTECTED]> wrote:
> I'm working on getting several of the SAGE dependencies not already in
> Debian maintained in the main Debian archive. I had a few questions about
> the future of some spkgs:
>
> I've heard rumor that linbox_wrap might be being m
On Wed, 07 May 2008 at 11:12AM -0700, William Stein wrote:
> On Wed, May 7, 2008 at 11:07 AM, John H Palmieri <[EMAIL PROTECTED]> wrote:
> > (For what it's worth, I've seen LaTeX gurus complain that one should
> > not use $$ $$ for displaying math; \[ \] is better. Should the
> > default value of
On Wed, May 7, 2008 at 5:19 PM, Franco Saliola <[EMAIL PROTECTED]> wrote:
>
> Hello.
>
>
> On Tue, May 6, 2008 at 6:17 PM, mabshoff <[EMAIL PROTECTED]> wrote:
> > Hhhm:
> >
> > gcc version 4.0.1 (Apple Computer, Inc. build 5341)
> >
>
When I try to connect to http://wiki.sagemath.org/ from various IP
addresses, I get the following error:
"Warning: You triggered the wiki's surge protection by doing too many
requests in a short time. Please make a short break reading the stuff you
already got. When you restart doing requests
I'm working on getting several of the SAGE dependencies not already in
Debian maintained in the main Debian archive. I had a few questions about
the future of some spkgs:
I've heard rumor that linbox_wrap might be being merged into mainline
linbox at some time in the near future. If this is
Hello.
On Tue, May 6, 2008 at 6:17 PM, mabshoff <[EMAIL PROTECTED]> wrote:
> Hhhm:
>
> gcc version 4.0.1 (Apple Computer, Inc. build 5341)
>
...
> That gcc isn't on the black list yet. Can you try updating to a newer
> XCode and try again?
No - sorry for not being clearer - this is from a source install.
-M. Hampton
On May 7, 5:21 pm, John H Palmieri <[EMAIL PROTECTED]> wrote:
> On May 7, 1:19 pm, mhampton <[EMAIL PROTECTED]> wrote:
>
> > I wonder what version the "30 seconds" comment was from. The code
> > base is probably growi
On May 7, 1:19 pm, mhampton <[EMAIL PROTECTED]> wrote:
> I wonder what version the "30 seconds" comment was from. The code
> base is probably growing faster than processor/hard drive speeds.
>
> On my Macbook, 2.4 Ghz intel chip, 5400rpm drive, a first clone of 3.0
> takes about 1 minute, the s
On Wed, May 7, 2008 at 2:42 PM, James <[EMAIL PROTECTED]> wrote:
>
> I am interested in working on making Sage work with OpenSolaris
> (http://opensolaris.org). This is 32 or 64 bit x86 architecture at
> this time with SPARC in the future. I would like to help anyone that
> is already going do
I am interested in working on making Sage work with OpenSolaris
(http://opensolaris.org). This is 32 or 64 bit x86 architecture at
this time with SPARC in the future. I would like to help anyone that
is already going down this path (since I work in the Solaris
organization). Please email me off th
Hi all,
The following should be of interest to many SAGE developers.
ANNOUNCEMENT
Quietly for the past couple of months, a group of developers has been
working towards a new version of GMP which can be used in SAGE and
related projects.
Q. Why wasn't I told about this?
A. We've been gradually
I wonder what version the "30 seconds" comment was from. The code
base is probably growing faster than processor/hard drive speeds.
On my Macbook, 2.4 Ghz intel chip, 5400rpm drive, a first clone of 3.0
takes about 1 minute, the second clone 30 seconds.
-M. Hampton
On May 7, 1:15 pm, John H Pa
On May 7, 11:25 am, John H Palmieri <[EMAIL PROTECTED]> wrote:
> On May 7, 11:12 am, "William Stein" <[EMAIL PROTECTED]> wrote:
>
> > On Wed, May 7, 2008 at 11:07 AM, John H Palmieri <[EMAIL PROTECTED]> wrote:
>
> > > (For what it's worth, I've seen LaTeX gurus complain that one should
> > > n
On May 7, 11:35 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Wed, May 7, 2008 at 11:27 AM, Nick Alexander <[EMAIL PROTECTED]> wrote:
>
> > On 7-May-08, at 11:14 AM, John H Palmieri wrote:
>
> > > In Section 7.1 of the Sage Programming Guide, it says
>
> > >> Creating clones of a reposi
On Wed, May 7, 2008 at 11:27 AM, Nick Alexander <[EMAIL PROTECTED]> wrote:
>
>
> On 7-May-08, at 11:14 AM, John H Palmieri wrote:
> >
> > In Section 7.1 of the Sage Programming Guide, it says
> >
> >> Creating clones of a repository should be fairly fast, e.g., about
> >> 30 seconds.
> >
>
On Wed, May 7, 2008 at 2:27 PM, Nick Alexander <[EMAIL PROTECTED]> wrote:
> > I just installed a fresh copy of Sage on my Mac and ran 'sage -clone
> > blah', and it took almost 15 minutes to complete. Running 'sage -clone
> > temp' a second time took just over one minute. Neither of these, and
On 7-May-08, at 11:14 AM, John H Palmieri wrote:
>
> In Section 7.1 of the Sage Programming Guide, it says
>
>> Creating clones of a repository should be fairly fast, e.g., about
>> 30 seconds.
>
> I just installed a fresh copy of Sage on my Mac and ran 'sage -clone
> blah', and it took almost
On May 7, 11:12 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> On Wed, May 7, 2008 at 11:07 AM, John H Palmieri <[EMAIL PROTECTED]> wrote:
>
> > (For what it's worth, I've seen LaTeX gurus complain that one should
> > not use $$ $$ for displaying math; \[ \] is better. Should the
> > defa
On Wed, May 7, 2008 at 8:12 PM, William Stein <[EMAIL PROTECTED]> wrote:
> Why? I think \[ and \] are ugly and hard to type compared to $$'s. What
> makes them so much better?
http://www.math.uiuc.edu/~hildebr/tex/course/intro1.html
The main advantage of the bracket pair "\[", "\]" over the
On May 7, 2008, at 5:50 AM, David Kohel wrote:
> Hi,
>
>>> Given algebras A and B, I would return C and the two maps m1: A -> C
>>> and m2: B -> C:
>>
>>> (C, m1, m2) = A.tensor_product(B,ring=R)
>>
>> I might prefer to have something like
>>
>> C = A.tensor_product(B, ring=R)
>>
>> and then
In Section 7.1 of the Sage Programming Guide, it says
> Creating clones of a repository should be fairly fast, e.g., about 30 seconds.
I just installed a fresh copy of Sage on my Mac and ran 'sage -clone
blah', and it took almost 15 minutes to complete. Running 'sage -clone
temp' a second time t
On Wed, May 7, 2008 at 11:07 AM, John H Palmieri <[EMAIL PROTECTED]> wrote:
> (For what it's worth, I've seen LaTeX gurus complain that one should
> not use $$ $$ for displaying math; \[ \] is better. Should the
> default value of 'sep' be changed?)
Why? I think \[ and \] are ugly and hard
The documentation for 'view' has one typo, and perhaps some other
problems. Part of it reads like this:
INPUT:
objects -- list (or object)
title -- string
zoom -- zoom factor, passed on to xdvi
expert -- bool (True or False): mode passed onto xdvi
debu
Hi,
Only three heroic people have signed up for Sage Bug Day 12 this Saturday:
http://wiki.sagemath.org/bug12
1. Michael Abshoff (old bugs)
2. William Stein (notebook bugs)
3. Craig Citro (current queue: #2535, unfiled enhancement for GammaH, #2329)
I hope more people will help out wit
On Wed, May 7, 2008 at 8:23 AM, Carlo Hamalainen
<[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> I think this is a bug. Solving x == y mod 3 works fine:
>
That's definitely a bug. We are tracking it here:
http://trac.sagemath.org/sage_trac/ticket/3124
> sage: var('x,y')
> (x, y)
> sage: solve_mo
Hi,
I think this is a bug. Solving x == y mod 3 works fine:
sage: var('x,y')
(x, y)
sage: solve_mod([x == y], 3)
[(0, 0), (1, 1), (2, 2)]
But solving mod 2 blows up:
sage: solve_mod([x == y], 2)
---
Traceback
Colleagues,
There is a cross-fertilization that might be very useful for both
the Scientific Linux world and the Sage world.
For those who don't know, Scientific Linux is a linux distribution
that is a "common platform" for scientific users. It was recently
described as:
Sage is an open source
On Wed, May 7, 2008 at 8:50 AM, David Kohel wrote:
> ...
> A good design is very important.
>
> In fact this is a vey generic categorical construction of (a sum or
> coproduct in the category of rings). We should first consider how
> general products and coproducts should be constructed, and set
> A good design is very important.
>
> In fact this is a vey generic categorical construction of (a sum or
> coproduct in the category of rings). We should first consider how
> general products and coproducts should be constructed, and set
> up a common infrastructure and syntax. It needs to b
Hi,
> > Given algebras A and B, I would return C and the two maps m1: A -> C
> > and m2: B -> C:
>
> > (C, m1, m2) = A.tensor_product(B,ring=R)
>
> I might prefer to have something like
>
> C = A.tensor_product(B, ring=R)
>
> and then one can do
>
> C.coerce_map_from(A)
> C.coerce_
2008/5/7 William Stein <[EMAIL PROTECTED]>:
>
> > > Back to work fixing #3111!
> >
> > That one actually exposed a bug in pari on OSX IMHO, too, i.e. when
> > Sage or pari fails to allocate any more memory it just fails. I think
> > the likely culprit is pari in this instance, but we will
> > Back to work fixing #3111!
>
> That one actually exposed a bug in pari on OSX IMHO, too, i.e. when
> Sage or pari fails to allocate any more memory it just fails. I think
> the likely culprit is pari in this instance, but we will see.
>
I think it is allocating too much memory because the
On May 6, 9:06 pm, "John Cremona" <[EMAIL PROTECTED]> wrote:
> Michael,
John,
> I hope you realised that I was only criticising my own lamentable lack
> of understanding and not your explanations. I think that the number
> of drinks I'll be buying you next time we meet must be into double
> f
35 matches
Mail list logo
