Well deserved,
congratulations Minh!
Cheers,
Georg
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
UR
Hi folks,
A binary of Sage 4.3.4 for SPARC Solaris 10 on the machine t2.math is
available at
http://sage.math.washington.edu/home/release/sage-4.3.4/sage-4.3.4-t2.math.washington.edu-sun4v-SunOS.tar.gz
Here is a summary of how I produced that binary.
(1) I logged into t2.math, took the source t
Minh,
In a few days that I was here, you were one of the most helpful guys,
together with William Stein, David Joyner and Mike Hansen, as well as
Jaap Spies himself. I guess that Jaap, William, and David can't have
this award, and Mike had it last year. That seems to be a rather
simple choice for
For his consistently conscientious commitment to Sage development,
Minh Nguyen is the recipient of the 2010 Spies Development Prize.
This award carries a prize of $500 from the Sage Foundation (thanks to
Jaap Spies).
Congratulations, Minh! This prize was earned, not won.
Nick
--
To post to th
On Sun, Mar 21, 2010 at 7:20 PM, Alec Mihailovs
wrote:
> Wow! Just installed the basic cygwin and it is working! I'll try to
> build Sage there.
There are still some major issues for Sage on Cygwin, but it's getting
close. I'm going to try get lots of the fixes in mainline Sage here
ASAP as well
On Mar 21, 9:28 pm, Alec Mihailovs wrote:
> Is it working in 64-bit Windows 7 now? I would be happy to install it
> again.
Wow! Just installed the basic cygwin and it is working! I'll try to
build Sage there.
Alec
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubs
Jaap,
> On my ugly 64 bit system I can run 32 bit software without a problem :)
Me too. But cygwin is a different story. A couple of years (or more?)
ago, when I switched from 32-bit Windows to 64-bit (XP at that time),
cygwin didn't work on 64-bit Windows. I used cygwin extensively for
many year
Alec Mihailovs wrote:
Jaap,
But wait! A native Windows Sage is almost there.
That would be excellent! I'm not sure that cygwin would work on my 64-
bit system (never tried it though.)
On my ugly 64 bit system I can run 32 bit software without a problem :)
Jaap
Alec
--
To post to th
On Sat, Mar 20, 2010 at 4:52 PM, Minh Nguyen wrote:
> Hi folks,
>
> Sage 4.3.4 was released on March 19, 2010. It is available at
>
> http://www.sagemath.org/download.html
I can't compile it on my linode.com server with g++ 4.3.3:
g++ -DHAVE_CONFIG_H -I. -I../.. -I../.. -I. -I../../li
Jaap,
> But wait! A native Windows Sage is almost there.
That would be excellent! I'm not sure that cygwin would work on my 64-
bit system (never tried it though.)
Alec
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage
On Mar 20, 9:17 pm, William Stein wrote:
> Hi -- I worked on this today, but it simply took too long for Sage to
> build. I will continue working on this next Monday (just over a week
> from now), when I get back to Canada, and then finally have a 4.3.4
> Virtualbox, unless of course some other
Alec Mihailovs wrote:
On Mar 21, 11:38 am, Ronan Paixão wrote:
Also, since I'm using that ugly OS,
For me, Windows 7 is beautiful!
You are joking!
Unfortunately, I have to use that ugly Linux most of the time when I
want to use Sage.
You are joking once more. But wait! A native Window
On Mar 21, 11:38 am, Ronan Paixão wrote:
> Also, since I'm using that ugly OS,
For me, Windows 7 is beautiful!
Unfortunately, I have to use that ugly Linux most of the time when I
want to use Sage.
> Also, the terminal which is opened when sage is autostarted, doesn't say that
> the showed IP
On 22 March 2010 00:06, Mike Hansen wrote:
> On Sun, Mar 21, 2010 at 2:50 PM, Florent Hivert
> wrote:
>> If anyone have access to this machine (or any Cygwin), can you test that
>> sage-4.3.4 with iconv-1.31.1.spkg replaced by
>> http://sage.math.washington.edu/home/kirkby/iconv/iconv-1.13.1.
On Sun, Mar 21, 2010 at 2:50 PM, Florent Hivert
wrote:
> If anyone have access to this machine (or any Cygwin), can you test that
> sage-4.3.4 with iconv-1.31.1.spkg replaced by
> http://sage.math.washington.edu/home/kirkby/iconv/iconv-1.13.1.p0.spkg
> correctly builds and set up a positive re
By the way, I looked at the help page for digits,
sage: base=7
sage: x=12345654321234565432123456543212345654321234565432123456
sage: x.digits?
and it is said there (at the end) that
" Using ``sum()`` and ``enumerate()`` to do the same thing is
slightly faster in many cases (and ``balance
Harald Schilly wrote:
On Mar 21, 7:14 pm, William Stein wrote:
Minh Van Nguyen is an integral part of the Sage development effort.
Congratulations, and yes, that's so true !!
H
Thanks for updating: http://www.sagemath.org/development-prize.html
Jaap
--
To post to this group, send an em
Dear Sage-Combinat and Chevie developers,
On Thu, Mar 18, 2010 at 05:17:34PM +0100, Nicolas M. Thiery wrote:
> There seems to be a consensus emerging on:
>
> http://doodle.com/ktma7rmvx4f3psbr
>
> for the Sage-Combinat/Chevie workshop to occur in the week from Monday
> June 14th t
On Wed, Mar 17, 2010 at 10:39:17PM -0700, William Stein wrote:
> I was wrong.It is stupid to spend a few days writing interface
> code to an existing library, when one can completely implement the
> algorithms in that library better from scratch in a few days.
This sounds right in the case at
Dear Robert & all,
Jean-Yves Thibon reported the following but with our free modules:
sage: K = QQ['x']
sage: V = CombinatorialFreeModule(K, [1,2,3])
sage: v = V.an_element()
sage: K(2/3) * v
4/3*B[1] + 4/3*B[2] + 2*B[3]
sage: (2/3) * v
Congratulations Minh! I really appreciate the massive amount of time
you put in on Sage.
-Marshall Hampton
On Mar 21, 1:14 pm, William Stein wrote:
> Hello,
>
> After much discussion, a secret committee has made the following announcement:
>
> -
>
> Minh
On 21 March 2010 18:14, William Stein wrote:
> Hello,
>
> After much discussion, a secret committee has made the following announcement:
>
> -
>
> Minh Van Nguyen is an integral part of the Sage development effort.
> He is awarded the 2010 Spies Development
Hi There,
Thanks to David, the issues #8567 "Change iconv so it builds on Cygwin and
Solaris only" seems to have a fix, but before giving positive review, I think
it should be tested on Cygwin...
> I think I owe everyone an explanation why the Sage 4.3.4 release is
> broken for Fedora and o
On Mar 21, 5:34 pm, Alec Mihailovs wrote:
> So both of them should be corrected by dealing with 0 separately and
> converting python int to Sage integers in int4.
Here are the corrected versions of int4 and poly_repr,
sage: def int4(z):
: C=reversed(map(int,z.polynomial().coeffs()))
On Mar 21, 5:01 pm, Martin Albrecht
wrote:
> sage: K.fetch_int(10)
> a^2 + 1
It's also working only for small fields.
Meanwhile, I found out that int4 returns python int in some cases. In
particular,
sage: type(int4(F.one()))
Also, neither int4, nor poly_repr work with 0,
sage: int4(F.zero
> However, for large fields, say GF(7^100), log_to_int is not
> implemented. Perhaps, either that name can be used instead of
> integer_representation, or something similar, say poly_to_int.
log_to_int is only available for Givaro fields because it represents finite
field elements as their logari
On Mar 21, 10:03 am, Martin Albrecht
wrote:
> In all cases it should return a Sage Integer not a
> Python int.
All of the functions intr, intr1, and int4 return a Sage integer, not
a Python int.
Also, for small fields, log_to_int operates the same way,
sage: F.=GF(2^6)
sage: r=F.random_element
On Sun, Mar 21, 2010 at 01:15:48PM -0700, Rob Beezer wrote:
> (shouting)
>
> CONGRATULATIONS, MINH!
(joining as a chorus)
CONGRATULATIONS, MINH!
Nicolas
--
Nicolas M. Thiéry "Isil"
http://Nicolas.Thiery.name/
--
To post to this group, send an email to sage-deve
(shouting)
CONGRATULATIONS, MINH!
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagem
On Mar 21, 7:14 pm, William Stein wrote:
> Minh Van Nguyen is an integral part of the Sage development effort.
Congratulations, and yes, that's so true !!
H
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsub
On Mar 21, 11:03 am, Florent Hivert
wrote:
> Hi there,
>
> Since sage-4.3.3 asking for Poset? doesn't print the docstring. I've no
> idea where to start to debug this issue. Any suggestion ?
The problem is with the "sphinxify" function; for some reason it
doesn't work on this docstring w
Florent Hivert wrote:
Minh Van Nguyen is an integral part of the Sage development effort.
He is awarded the 2010 Spies Development Prize in recognition of his
code contributions, release management, support for new users and
outstanding work on documentation.
[...]
To bad he went to sleep 1 ho
I hesitate between "Great" and "Amazing" Impressive work at the
least :-)
Nathann
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://grou
Congratulations Minh!
On Sun, Mar 21, 2010 at 2:14 PM, William Stein wrote:
> Hello,
>
> After much discussion, a secret committee has made the following announcement:
>
> -
>
> Minh Van Nguyen is an integral part of the Sage development effort.
> He is aw
On Sunday, March 21, 2010, Florent Hivert wrote:
>> Minh Van Nguyen is an integral part of the Sage development effort.
>> He is awarded the 2010 Spies Development Prize in recognition of his
>> code contributions, release management, support for new users and
>> outstanding work on documentation.
Congratulations!
Ronan
De: William Stein
Para: sage-devel ; Minh Nguyen
Enviadas: Domingo, 21 de Março de 2010 15:14:55
Assunto: [sage-devel] Annual Spies Prize Winner Announced!
Hello,
After much discussion, a secret committee has made the following anno
> Minh Van Nguyen is an integral part of the Sage development effort.
> He is awarded the 2010 Spies Development Prize in recognition of his
> code contributions, release management, support for new users and
> outstanding work on documentation.
[...]
To bad he went to sleep 1 hour ago ! And Brav
Hello,
After much discussion, a secret committee has made the following announcement:
-
Minh Van Nguyen is an integral part of the Sage development effort.
He is awarded the 2010 Spies Development Prize in recognition of his
code contributions, release man
Hi there,
Since sage-4.3.3 asking for Poset? doesn't print the docstring. I've no
idea where to start to debug this issue. Any suggestion ?
Cheers,
Florent
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-dev
2010/3/21 Dr. David Kirkby :
> Minh Nguyen wrote:
>>
>> Hi folks,
>
>
>
>> From my experience with machines on Skynet, building
>> and doctesting Sage on some of the Linux machines could actually crash
>> the machine. Most times for me, such a crash would result in bringing
>> a machine down, or e
Hi all,
I've been away for some time, since I had to switch to this other ugly OS some
time ago, but recently a student asked me some help about Elliptic Curves, and
since all I know about that was that sage supports it, I pointed to it.
Anyway, that sparked some interest again in sage, so I wa
> (suggestions, or better patches, to improve that example are welcome)
Earlier I posted code to construct exterior algebras in Sage here:
http://sporadic.stanford.edu/bump/exterior.sage
This uses CombinatorialAlgebras. Currently the preferred method of
constructing a ring is to implement it as
Minh Nguyen wrote:
Hi folks,
From my experience with machines on Skynet, building
and doctesting Sage on some of the Linux machines could actually crash
the machine. Most times for me, such a crash would result in bringing
a machine down, or even bringing down the primary network node that i
I wrote the small finite field class and added the int_repr() and forgot to
add something equivalent for bigger fields. I would suggest to add a new
function to both called integer_representation() (or so) and deprecate the
shorthand int_repr(). In all cases it should return a Sage Integer not a
Jan,
This happens if (and only if?) you have the optional database
installed, since then calls to E.gens() return the database generators
rather than computing them.
I just report this to Robert Miller since heegner.py is the only file
with this behaviour now (there used to be a lot more). So it
> I think 2. is exactly what you want.
Clearly ! :-)
I only looked at Poset? before asking my question.. And the reference
manual displays the good version of the documentation :
http://www.sagemath.org/doc/reference/sage/combinat/posets/posets.html
Thank youuu !! :-)
Nathann
--
To post
Hi Nathann,
> I am writing a pretty simple code, which generates several subsets of [n]. I
> would like to take from this list of subsets the list of maximal elements,
> which I feel should be the job of the Poset class, though it looks like it
> only accepts DiGraph as an input...
>
> Well
Hi
Installed Sage 4.3.4 on 643bit Ubuntu 9.04 jaunty from source, with optional
packages:
0 r...@muizenberg:/usr/local/src/sage-4.3.4/spkg#ls optional/ huge
huge:
README.txt stein-watkins-ecdb.spkg stein-watkins-ecdb.spkg.md5
optional/:
biopython-1.53.p0.spkg
Hi there,
> In order to have a sustainable contributor base, I think Sage needs to
> have some kind of mentoring program along the lines of the Ubuntu
> mentoring program [1]. People on the Sage mailing lists do answer
> questions and try to help each other out. But we're all humans.
> Somet
Minh Nguyen wrote:
Hi folks,
On Sun, Mar 21, 2010 at 9:10 PM, Florent Hivert
wrote:
I don't know what to do and I've no more time to investigate (I already spend
half of my week-end on it together with the rebase of sage-combinat
queue). Also I must confess I'm far from being an expert on t
Hi Burcin,
On Sun, Mar 21, 2010 at 10:08 PM, Burcin Erocal wrote:
> There are lot's of occasions when I look at a bug filed under the
> symbolics component and say that it would be easy to fix, but cannot
> justify taking the time to fix it then myself. When I actually find
> some time to work
Hello everybody !!!
I am writing a pretty simple code, which generates several subsets of [n]. I
would like to take from this list of subsets the list of maximal elements,
which I feel should be the job of the Poset class, though it looks like it
only accepts DiGraph as an input...
Well, do you t
On Mar 21, 11:58 am, Ralf Hemmecke wrote:
> Does somebody know whether (and how) I can convince Sage to work with an
> existing FriCAS (compiled with sbcl) instead of compiling+installing the
> fricas.spkg?
>
> Ralf
Hi,
Since the interface to fricas is pexpect I would not have expected any
pro
Hi folks,
On Sun, Mar 21, 2010 at 9:10 PM, Florent Hivert
wrote:
> I don't know what to do and I've no more time to investigate (I already spend
> half of my week-end on it together with the rebase of sage-combinat
> queue). Also I must confess I'm far from being an expert on those issues. So
> What I gather from your proposals above is that we need to have some
> kind of lists of "easy" tickets for someone to nibble on (chew lightly
> for a few hours). The idea of such an "easy" list is to anticipate
> someone coming along and say, "I'm new to Sage. I would like to help
> out with its
Hi Ralf,
On Sun, Mar 21, 2010 at 9:58 PM, Ralf Hemmecke wrote:
> Does somebody know whether (and how) I can convince Sage to work with an
> existing FriCAS (compiled with sbcl) instead of compiling+installing the
> fricas.spkg?
You might know this already: Say your system has a version of FriCAS
Hi Minh,
On Sat, 20 Mar 2010 23:12:56 +1100
Minh Nguyen wrote:
> On Sat, Mar 20, 2010 at 10:39 PM, Burcin Erocal
> wrote:
>
>
>
> > - replace the "GSoC 2010" link on the front page of the web site
> > with a "Help Wanted" or "Get Involved!" link. The "development"
> > section of the site (wh
Does somebody know whether (and how) I can convince Sage to work with an
existing FriCAS (compiled with sbcl) instead of compiling+installing the
fricas.spkg?
Ralf
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-deve
Hi William,
> > On Fedora 12 x86_64 I had build failures with gd and atlas.
> >
> > The gd issue could be resolved by putting /usr/include/iconv.h and
> > /usr/bin/iconv aside.
I can confirm that the same issues occur on openSuSE 11.1 (64), 11.0 (32),
gentoo 1.12.9 (64), and mandriva 1010 (
On Sat, Mar 20, 2010 at 08:52:54AM -0700, Rob Beezer wrote:
> On Mar 20, 8:07 am, "Nicolas M. Thiery"
> wrote:
> > Cayley graph feature (#7555)
>
> Cayley TABLES (and other "operation tables"). Cayley GRAPHS are due
> to Moretti/Miller/Thiery. ;-)
Oops :-)
> I can testify to that. If you hav
On Sat, Mar 20, 2010 at 03:50:43PM +, John Cremona wrote:
> PS This would be a suitable discussion for the newly-formed sage-algebra list!
Oops, right!
Speaking of that: the primary purpose of sage-algebra is to allow
people to follow algebra related discussions without having to follow
all o
On Sat, Mar 20, 2010 at 03:50:43PM +, John Cremona wrote:
> There are surely many other similar situations, for example when
> constructing a commutative ring it might be expensive to determine
> whether or not it is an Integral Domain.
Yup.
> I would always use GF(p) rather than IntegerMod(p
On Sat, Mar 20, 2010 at 11:52 AM, Rob Beezer wrote:
>> (2) IntegerModRing(n) is always in CommutativeRings()
IMO this is the one that makes sense, by the same reasons why:
sage: parent(2/1)
Rational Field
IOW, IntegerModRing should be a map from ZZ to CommutativeRings()
This is the only "natur
On Sat, Mar 20, 2010 at 04:35:01PM +0100, Florent hivert wrote:
> Hi There,
>
> > In order to let Rob use IntegerModRing(n) as example of finite
> > additive group for his cool Cayley graph feature (#7555), I just wrote
> > a patch (#8562) letting IntegerModRing(n) use the category
> > frame
On Mar 20, 10:11 pm, Minh Nguyen wrote:
> On Sun, Mar 21, 2010 at 10:19 AM, Alasdair McAndrew wrote:
> > def intr(z):
> > C=z.polynomial().coeffs()
> > fc=parent(z).characteristic()
> > tmp=0
> > for i in range(len(C),0,-1):
> > tmp=fc*tmp+int(C[i-1])
> > return tmp
65 matches
Mail list logo
