Yes the basic reference is ONAG. I will put a more precise
reference in the source (but I need to go to the library
to fetch ONAG). Basically the two rules for multiplying
nimbers are
(1) The product of any number of distinct Fermat powers
is the ordinary product.
(2) If f is a Fermat power then
On Monday 19 March 2007 8:28 pm, Hamptonio wrote:
> Hi,
>
> I became interested in SAGE after I found it to be the easiest way to
> install cddlib and gmp, and now I am getting hooked. My research is
> very schizophrenic: besides some computational algebra/geometry coming
> from dynamical systems
Hi,
I became interested in SAGE after I found it to be the easiest way to
install cddlib and gmp, and now I am getting hooked. My research is
very schizophrenic: besides some computational algebra/geometry coming
from dynamical systems, I am also interested in mathematical biology
and bioinforma
On March 19, 2007 2:44 PM Bill Page wrote:
>
> Students of Sage might be interested in the Axiom/Sage project
> supported by an Axiom sister organization (LispNYC) that has
> been accepted for the Google Summer of Code program. Axiom had
> a previous successful Summer of Code project that was fun
Hi William,
Perhaps you should put up a note on http://www.sagemath.org informing
people to download from the mirrors instead of your home connection.
I imagine it is going to get killed by anymore than 1 person
downloading at a time :)
On Mar 19, 2007, at 2:15 PM, William Stein wrote:
>
-- Forwarded message --
From: that mathematician :-)
>From Jason Martin:
> Don't feel like you need to spend too much time defending Sage.
I don't think you were defending it, just explaining it :-)
And I certainly haven't ever managed a programming project of any size
whatsoeve
Don't feel like you need to spend too much time defending Sage. It
speaks for itself. It's free, open source, and improving daily. And,
even though I greatly admire "a top research mathematician who happens
to write assembly code to find Hecke operators... now who might that
be," I don't think
Hi,
sage.math will be turned off in about 1 hour. A few minutes ago, I
backed up the hard drive to
modular.math.washington.edu, so if you go to
http://modular.math.washington.edu/home
you'll get the latest version of people's home directories, at least
if they are world
readable (let me know
-- Forwarded message --
From: William Stein <[EMAIL PROTECTED]>
Date: Mar 19, 2007 1:57 PM
Subject: Re: some ramblings about the relationship between sage and MAGMA
To: Research mathematician
On 3/19/07, a Research Matheamtician wrote:
> I think the reason that xxx found it [sage]
On 3/19/07, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
> > Did you look at LAGUNA or UnitLib?
>
> Yeah, I looked at LAGUNA, and it wasn't exactly what I was looking
> for. I guess I'm more interested in the looking at the group algebras
> as K[G]-modules.
If I understand correctly, the following i
Are you using ONAG for the main reference? In any case, I would appreciate
a precise reference to a book or article on nimbers.
On 3/19/07, Michel <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> To acquant myself with sage's inner workings I have implemented
> Conway's nimber field.
> See
>
> http://alpha
> Did you look at LAGUNA or UnitLib?
Yeah, I looked at LAGUNA, and it wasn't exactly what I was looking
for. I guess I'm more interested in the looking at the group algebras
as K[G]-modules.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@go
On 3/19/07, a top research mathematician wrote:
> put me off sage a bit: he tried it a year or so ago and
> after a while he realised that he was actually just coding in python
> rather than sage, and that magma seemed to be much quicker. Maybe this
> has changed now though. How can sage over
Group algebras would be natural and interesting. I would suggest
that they derive from FreeAlgebra, and improve those if the
performance was inadequate. This gives a sparse representation,
and as I remember, for finite dimensional (quotient) algebras, I
use the explicit matrix representation on
Students of Sage might be interested in the Axiom/Sage project
supported by an Axiom sister organization (LispNYC) that has
been accepted for the Google Summer of Code program. Axiom had
a previous successful Summer of Code project that was funded
in a similar manner through LispNYC in the first S
The famous sage.math.washington.edu is up until probably 5pm today. :-)
--
William Stein
Associate Professor of Mathematics
University of Washington
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this gr
Hi,
To acquant myself with sage's inner workings I have implemented
Conway's nimber field.
See
http://alpha.uhasselt.be/Research/Algebra/Members/nimbers/
Recall that the nimbers form a field whose underlying set is the
natural numbers. The addition is bitwise exclusive or but the
multiplication
On 3/19/07, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
> I guess this is mostly directed toward David Joyner, but if anyone
> else knows, feel free to chime in. I've been trying to figure out the
> best way to do calculations in a group ring or group algebra. I've
> checked around for GAP packages
On 3/19/07, David Harvey <[EMAIL PROTECTED]> wrote:
> On Mar 19, 2007, at 9:58 AM, Mike Hansen wrote:
> > I guess this is mostly directed toward David Joyner, but if anyone
> > else knows, feel free to chime in. I've been trying to figure out the
> > best way to do calculations in a group ring or
On 3/19/07, Mike Hansen <[EMAIL PROTECTED]> wrote:
> > : unhashable type:
> > 'sage.rings.complex_number.ComplexNumber'
>
> You should be able to just add the following to the ComplexNumber class:
>
> def __hash__(self):
> return str(self).__hash__()
>
> That should work so long as the complex
On Mar 19, 2007, at 9:58 AM, Mike Hansen wrote:
> I guess this is mostly directed toward David Joyner, but if anyone
> else knows, feel free to chime in. I've been trying to figure out the
> best way to do calculations in a group ring or group algebra. I've
> checked around for GAP packages, b
That's really awesome -- I didn't realize they used SAGE.
Representation theory represent :)
--Mike
On 3/19/07, David Harvey <[EMAIL PROTECTED]> wrote:
>
> http://news.bbc.co.uk/2/hi/science/nature/6466129.stm
>
> It's an article about the recent calculation of the character table
> of E8, which
http://news.bbc.co.uk/2/hi/science/nature/6466129.stm
It's an article about the recent calculation of the character table
of E8, which was done on sage.math... here's how the BBC put it:
"Conceptualising, designing and running the calculations took a team
of 19 mathematicians four years. The
I guess this is mostly directed toward David Joyner, but if anyone
else knows, feel free to chime in. I've been trying to figure out the
best way to do calculations in a group ring or group algebra. I've
checked around for GAP packages, but they seem to be pretty limited
and very awkward to use.
Hello all:
Has anyone here heard of pydx?
- David Joyner
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google
> While working on the patch, I came across another problem, one that I
> don't want to fix.
>
> sage: D = {} ; D[CC(0)] = 1
> ---
> Traceback (most recent call
> last)
>
> /Users/nalexand/emacs/sage/ in ()
>
> :
While working on the patch, I came across another problem, one that I
don't want to fix.
sage: D = {} ; D[CC(0)] = 1
---
Traceback (most recent call
last)
/Users/nalexand/emacs/sage/ in ()
: unhashable type:
's
27 matches
Mail list logo
