Hi there,
NexentaOS (aka GNU/Solaris) is an open-source unix with the SunOS
kernel and GNU tools on top of it. Package management is done with
Debian's apt-get. I am investigating using NexentaOS as a file/media
server on a newish P4 (mainly because of zfs) and thought I would try
to build SAGE on
On 5/28/07, Emil Volcheck <[EMAIL PROTECTED]> wrote:
> I've been spending my vacation this weekend at Balticon,
> the Baltimore Science Fiction convention (See http://www.Balticon.org/ ).
> I spend most of my time in the science track, and one of the
> speakers was noted open source guru, Eric Ray
> On 5/28/07, Emil Volcheck <[EMAIL PROTECTED]> wrote:
> > Maybe we need to devise a concept of "support license" for OSCAS by
> > which a researcher can voluntarily allocate part of their grant to
> > contribute to the development effort for OSCAS. I think of "support
> > license" as a term of a
On 5/28/07, Jordi Gutierrez Hermoso <[EMAIL PROTECTED]> wrote:
> On 28/05/07, William Stein <[EMAIL PROTECTED]> wrote:
> > On 5/28/07, Jordi Gutierrez Hermoso <[EMAIL PROTECTED]> wrote:
> > > Just a quick question, the versions of Octave, Maxima, Pari, et al
> > > that you have in SAGE, are they p
A minor correction.
On page 2, line -4 the word read is repeated.
On May 28, 8:39 pm, David Joyner <[EMAIL PROTECTED]> wrote:
> Hello Emil, SAGE developers:
>
> Following a suggestion of Emil Volcheck of ACM/SIGSAM and Bob Grafton
> of NSF, and William and I have drafted a "white paper" on NFS f
On 5/28/07, Emil Volcheck <[EMAIL PROTECTED]> wrote:
> Thanks, David.
>
> I applaud your quick work. I've forwarded your message to the SIGSAM
> Officers list as well as to our white paper committee.
>
> I'll get back to you with comments on your draft within two weeks.
>
> Thank you for includin
On 5/28/07, Bill Hart <[EMAIL PROTECTED]> wrote:
> These days sage.math is often operating with all 16 cores going flat
> out.
This will stop. I'm going to systematically ask all users of
sage.math to stop pushing the hardware like this. The *primary*
purpose of sage.math is for SAGE software d
One trick to get a few local temporary variables in GAP is to use
functions. For instance:
sage: gap.new("CallFuncList(function() local F; F := FreeGroup(2);
return F/[F.1*F.2*F.1^-1*F.2^-1]; end,[])")
I believe David Joyner has already suggested a better method for this
particular example, s
These days sage.math is often operating with all 16 cores going flat
out.
When it gets like this, FLINT slows down dramatically, but MAGMA does
not. This makes timing comparisons meaningless (and slows down
development).
I'm wondering if anyone has any suggestions as to why this might be.
How ca
To create a fp group you have to define relations on the generators
of a free group. To define the generators, you have to have a
notation for the group. Why not have the _init_ method of the
class define a "(free) base group", "generators (of the free gp)",
"relations"? Something roughly (this is
On 5/28/07, Nathan Dunfield <[EMAIL PROTECTED]> wrote:
> I'm trying to hack up a quick finitely presented group class, and am
> trying to write the _gap_init_ method. In simple cases, _gap_init_
> returns a string, but I can't come up with one that works; e.g. the
> following fails
>
> sage: gap
Dear All,
How does one create new GAP objects that require a multi-step
command? For instance, to create a finitely presented group in GAP
one does:
gap: F := FreeGroup(2)
gap: G := F/[F.1*F.2*F.1^-1*F.2^-1]
I'm trying to hack up a quick finitely presented group class, and am
trying to write
I don't think you want to them as doctests, they take dozens of
minutes to run! (That is, for the cached rings which take 1 times
longer to compute.) Ideally this issue can be fixed, but I'm not sure
how...
- Robert
On May 28, 2007, at 4:35 PM, Nick Alexander wrote:
> Robert Bradshaw
On May 28, 2007, at 7:38 PM, Nick Alexander wrote:
>
> "William Stein" <[EMAIL PROTECTED]> writes:
>
>> SUMMARY: There is a huge amount of crypto-related functionality in
>> SAGE already, but it is "all over", and there are some exciting
>> and unique
>> cryptographic algorithms that could be
On May 29, 3:39 am, David Joyner <[EMAIL PROTECTED]> wrote:
> Hello Emil, SAGE developers:
>
> Following a suggestion of Emil Volcheck of ACM/SIGSAM and Bob Grafton
> of NSF, and William and I have drafted a "white paper" on NFS funding
> of mathematical software. It is
> athttp://sage.math.was
"William Stein" <[EMAIL PROTECTED]> writes:
> SUMMARY: There is a huge amount of crypto-related functionality in
> SAGE already, but it is "all over", and there are some exciting and unique
> cryptographic algorithms that could be implemented in SAGE that
> aren't implemented now.
In addition, S
Robert Bradshaw <[EMAIL PROTECTED]> writes:
> I'm kind of late jumping into this thread, but I have some concerns.
> Unless the factorization is known completely (or gcd's are taken on
> the unknown part), I still think this can lead to combinatorial
> explosion fairly quickly. For example,
Hello Emil, SAGE developers:
Following a suggestion of Emil Volcheck of ACM/SIGSAM and Bob Grafton
of NSF, and William and I have drafted a "white paper" on NFS funding
of mathematical software. It is at
http://sage.math.washington.edu/home/wdj/research/oscas-nsf-white-paper2.pdf
Comments would b
I'm kind of late jumping into this thread, but I have some concerns.
Unless the factorization is known completely (or gcd's are taken on
the unknown part), I still think this can lead to combinatorial
explosion fairly quickly. For example,
sage: from sage.rings.fraction_field_cache import
On 5/28/07, Robert Bradshaw <[EMAIL PROTECTED]> wrote:
>
> I'm just glad those are the only two sticky issues. I think we're
> fine with jsmath, as you said it's not linked--just distributed and
> run (separately) on the user's browser. We don't have to place
> license restrictions on the browser.
One thing that -- I think -- is missing from most of those crypto
implementations is the ability to scale down below secure thresholds, i.e.,
to use toy cipher variants. As we are not interested in productivity crypto
but in research that would be very valuable. So reduced round/blocksize
vari
I'm just glad those are the only two sticky issues. I think we're
fine with jsmath, as you said it's not linked--just distributed and
run (separately) on the user's browser. We don't have to place
license restrictions on the browser...
Hopefully the author of Tachyon gets back to us--I woul
On 5/28/07, Andrew Budker <[EMAIL PROTECTED]> wrote:
>
> My name is Andrew Budker and I'm a fourth year undergraduate
> Mathematics of Computation student at UCLA. This quarter (and over the
> summer) I'll be taking an independent studies course with Nathan Ryan,
> and hope to be able to contribut
Hi,
My name is Andrew Budker and I'm a fourth year undergraduate
Mathematics of Computation student at UCLA. This quarter (and over the
summer) I'll be taking an independent studies course with Nathan Ryan,
and hope to be able to contribute to the SAGE project. I've taken two
courses in cryptolog
On May 28, 2007, at 06:23 , David Harvey wrote:
> On May 28, 2007, at 4:36 AM, Michel wrote:
[snip]
> I think I would generally support including the code you are
> proposing, assuming a referee is happy with the code. (I insist
> however on the spelling "caching" rather than "cacheing" :-))
Eww
On May 27, 2007, at 11:47 , David Harvey wrote:
> On May 27, 2007, at 2:21 PM, Michel wrote:
[snip]
> Well I have another idea, I'm not sure to what extent this is already
> implemented in your factor_cache.pyx, or to what extent it even makes
> sense. (I haven't actually looked at your code yet.
On May 28, 2007, at 2:02 PM, Michel wrote:
> This being said I actually want FractionField_cache to be optional so
> that I can improve
> it without disrupting anything else. Om my sage installation I have
> given the FractionField method an extra optional parameter 'cache='
> which
> when true
>
> I think I would generally support including the code you are
> proposing, assuming a referee is happy with the code. (I insist
> however on the spelling "caching" rather than "cacheing" :-))
>
No problem. For me cache is a french word. Hence cacheing. But Google
seems to favor caching by far.
Michel <[EMAIL PROTECTED]> writes:
> Question: What should I do now? I think the implementation of
> FractionField_cache
> improves upon the implementation of FractionField_generic. Please
> give some feedback.
Hi Michel,
I will referee this patch. Since it is a little involved, I may take
a f
On May 28, 2007, at 4:36 AM, Michel wrote:
>> Does this idea
>> only make sense over division rings? Because it is sometimes nice to
>> do integer arithmetic and have everything factored, as well.
>
> The factor cache works of course for non-fields. There is not much
> point
> taking the fracti
> I vote +1 to this idea, because it is more modular. Does this idea
> only make sense over division rings? Because it is sometimes nice to
> do integer arithmetic and have everything factored, as well.
>
> I will referee such a patch, if needed.
Hi,
I would very much prefer the patch to be re
31 matches
Mail list logo
