I guess because I usually
think of GNU as an umbrella project, whereas I think of Python and
Firefox as more specific, and I see them all over the place all the
time.
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
T
Since you asked:-)
A small project would be to look at the DE-related code
in the *.sage files contained in SAGEHOME/examples/calculus
and create a SAGE/Python module from them. They may be fine
as is or may need some changes (I wrote them but would very
much appreciate another person's perspecti
14.8 seconds
Ummm I just did a clean install of sage 2.5 on a powerpc OS X, and
the cf directory doesn't even exist.
david
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"sage-devel" gr
tain as FLINT matures,
until the time is ready to actually bring it into SAGE.
David
--~--~-~--~~~---~--~~
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
not pointed out anywhere in the tutorial or
> reference manual. In every book I've used, "eigenvector" means the
> right-eigenvector.
>
> -Marshall Hampton
>
> On Dec 4 2006, 12:39 pm, David Joyner <[EMAIL PROTECTED]> wrote:
> > Here is a completely sepa
Zimmerman).
=======
David
--~--~-~--~~~---~--~~
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.com/group/sage-devel
integer.
> After all the point of an IntervalField is to have results which are
> guaranteed to be correct.
I would want the floor function to return an element of the
IntegerInterval ring. Sadly it does not exist as far as I know.
David
--~--~-~--~~~---~--~---
ey were as they were.
The reason to use Integer(i) in general is that, in .py and .pyx files, if
you use just i, Python will use Python ints, which may or may not be what
you want (it's somewhat useful as loop variables, but otherwise you'd
probabl
"SAGE in the news" - from a recent thread in the maxima email list.
-- Forwarded message --
From: Vadim <[EMAIL PROTECTED]>
Date: May 11, 2007 5:04 PM
Subject: Re: [Maxima] Computer algebra system?
To: Hedos <[EMAIL PROTECTED]>
Cc: [EMAIL PROTECTED]
Hedos wrote:
> Hello!
> Than
more "SAGE in the News"
-- Forwarded message --
From: Richard Fateman <[EMAIL PROTECTED]>
Date: May 12, 2007 10:20 AM
Subject: Re: [Maxima] Computer algebra system? / SAGE and Pipes
To: [EMAIL PROTECTED]
The comment that SAGE's mechanisms are good (or adequate) for linking
vario
But shouldn't the rank of m (as a (ZZ/4ZZ)-module) be 1?
I'm surprised someone implemented (if even bug-ily, if bug-ily
is a word) a method for determining the rank of a (ZZ/mZZ)-module,
for M is not a prime.
Nick Alexander wrote:
>
> sage: m = matrix(Integers(4), 2, 2, [2, 2, 2, 2])
>
> sage:
"give me the high-performance version, I
don't care if the build takes a bit longer". Does this already exist?
I mean something like "make fast". Actually maybe that's a bad name,
maybe it should be called "make slow" :-)
david
--~--~-~--~-
On 5/14/07, Martin Albrecht <[EMAIL PROTECTED]> wrote:
>
> Hi there,
>
> I am having trouble re-implementing MPolynomial.coeffient. The docstring
> states:
>
> If f is this polynomial, then the coefficient is the sum T/mon
> where the sum is over terms T in f that are exactly divis
On May 13, 2007, at 9:59 PM, William Stein wrote:
>
> On 5/13/07, David Harvey <[EMAIL PROTECTED]> wrote:
>> I recently wrote a C++ program that uses the NTL library for
>> polynomial arithmetic. I wrote a pyrex wrapper and put it into SAGE.
>> (Hopefully it will
Using the analogy with primes, p^e||n iff p^e|n and p^{e+1} not not divide n:
y^e||f(x,y) iff y^{e}|f(x,y) and y^{e+1} does not divide f(x,y). Here I'm
implicitly assuming that y is a generator of the ring which f(x,y) belongs to.
For monomials which are not generators then I'm not sure what
"exa
On 5/14/07, Martin Albrecht <[EMAIL PROTECTED]> wrote:
>
> On Monday 14 May 2007 15:00, Michel wrote:
> > Assuming all this is correct then I can see
> >
> > > why Martin is objecting to the docstring's vagueness, but AFAIK the
> > > behavior is correct.
> >
> > Yes I now thinks so too.
>
> Pleas
Is there a resource leak problem with apache on sage.math? Almost
half of sage.math's memory is being eaten by a few www-data
processes. Is that someone running crazy things on the notebook?
david
--~--~-~--~~~---~--~~
You received this message becaus
x27;s right, my laptop can't address that much
memory. Never mind.
david
--~--~-~--~~~---~--~~
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 th
wing
> perhaps ``Algorithms for Linear Algebra Problems over Principal Ideal
> Rings'' (1996), Johannes Buchmann, Stefan Neis at
>
> http://citeseer.ist.psu.edu/719844.html
>
> I'm also very interested in working on the commutative diagram
> coercion model proposed
I will probably be sharing a hotel room 11th - 14th (inclusive) with
Craig. This leaves me with the 15th and 16th. Does anyone else need a
room then.
Nick, I noticed you have asked about 14th - 16th. So we overlap
except for one day.
david
I would first try to interest a Seattle Times reporter in the
David vs Goliath slant. They will know when the sauce is being
poured on too thick.I agree this is a bit confontational in tone but I
also agree with Dennis' sentiments (if I understand them) which is to
try to create a "god
open source, I don't think one can really describe their functionality as
limited. I don't think it's worth angering people who develop and use those
systems in order to interest people who have no idea what Mathematica is.
David
On 5/16/07, Martin Albrecht <[EMAIL PROTECTED
. They can go about their business, and we can go about ours.
I'm also not quite sure what is the point of advertising to the
general public. We should be focusing our marketing at potential
users and developers, which are mainly people in academic (research
or teaching) and engineering setti
When I click on "view the tutorial" from sagenb.org, I get some funny
error message about proxy servers. Is the problem with my ISP, or is
it at the notebook server end?
david
--~--~-~--~~~---~--~~
To post to this group, send email to
arentWithGens. We don't have a ElementOfParentWithGens though,
do we.
David
--~--~-~--~~~---~--~~
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,
I may be implementing something like this for p-adics soon. It's one of the
options for doing gcds meaningfully. If anyone else is interested in
working on this, get in touch with me.
David
On 5/17/07, Michel <[EMAIL PROTECTED]> wrote:
>
>
> It is rather frustrating that sa
ight have:
>
> http://sage.math.washington.edu/tmp/survey.pdf
Clearly, if we're going to get anywhere, we need to start with M. I
propose renaming the project MAGE.
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegro
o
address, and a number of us are planning to devote considerable time to
it at the next SAGE developer's workshop in mid-June. My guess, without
looking at the code, is that it's probably not worth trying to fix the
particular problem you noted, it would probably end
e to discuss this more easily at SD4.
david
--~--~-~--~~~---~--~~
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.com/group
hat it will do is make much more sophisticated canonical
> coercions possible, which the current system doesn't support.
> I very much want to see such more sophisticated coercions
> be supported in the future. Robert Bradshaw and I spent
> a lot of time thinking up almost the same
How would this work? If sagemath was down or there wasn't a net connection
would there be a weird error? Would it confuse users who could not update
(eg, students using the SAGE notebook in a lab)?
On 5/18/07, Nick Alexander <[EMAIL PROTECTED]> wrote:
>
> "William Stein" <[EMAIL PROTECTED]> wri
I'm worried that this check is going to slow down a developer
working on a cloned copy. In this case, one is probably not interested
in updating. Could this auto-update be turned off by default in all clones?
William Stein wrote:
> On 5/18/07, David Joyner <[EMAIL PROTECTED]>
[EMAIL PROTECTED] wrote:
> Given: I'm currently taking undergrad algebra, and I'm not as well-steeped in
> fields as I'd like. But Wikipedia tells me that a polynomial ring over any
> field is Euclidean... so this seems horribly, horribly wrong.
>
A polynomial ring in one variable over a fiel
Is gdmodule currently in SAGE? I can see files with the name gdmodule
in them, but I would have thought I could just do "import gdmodule",
but that doesn't work.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@goog
On May 21, 2007, at 11:06 PM, William Stein wrote:
>
> On 5/21/07, David Harvey <[EMAIL PROTECTED]> wrote:
>> Is gdmodule currently in SAGE? I can see files with the name gdmodule
>> in them, but I would have thought I could just do "import gdmodule",
>>
le to
recognize this kind of situation and handle it appropriately. Personally,
I'd like to see what comes out of discussions at SD4 (or before too I
suppose) on the feasibility of such an extension to Sage's coercion model,
and how it would work.
David
On 5/22/07, Michel <[EMAIL
On May 22, 2007, at 3:10 AM, [EMAIL PROTECTED] wrote:
> * Are we going to throw exceptions when units of differing type
> are added?
>
> 1*meters + 2*meters*meters : NOT OK.
> 1*meters + 2*feet = ... in feet or meters? (I say meters)
I say
I hate significant figures. Use real error propogation and standard
deviations instead.
David
On 5/22/07, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
>
>
>
>
> On Tue, 22 May 2007, David Harvey wrote:
>
> >> 1*meters + 2*meters*meters : NOT OK.
> &g
e anything for computations of a practical size. My guess is
that it wouldn't start beating existing implementations until you're
trying to multiply integers with perhaps 2^100 digits. Give or take a
few. I might be wrong about this though; the author of t
ges, it looks like linbox got hit by this
> change (from http://gcc.gnu.org/gcc-4.2/changes.html):
> "The (undocumented) extension which permitted templates with default
> arguments to be bound to template template parameters with fewer
> parameters has been removed."
I w
On 5/23/07, William Stein <[EMAIL PROTECTED]> wrote:
>
> On 5/23/07, Marshall Hampton <[EMAIL PROTECTED]> wrote:
> > Surface plots are very important for my sage-teaching plans.
> > Currently the maxima surface plots don't work for a notebook running
> > on a different machine (unless there is som
(sqrt(x^2 + y^2))
> def c(x,y,z):
>return (abs(z),0,abs(sin(sqrt(x^2+y^2
>
> testplot(f,srange(-5,5,.1),srange(-5,5,.1),colorf=c).show(axes=False)
>
>
>
>
> On Thu, 24 May 2007, David Joyner wrote:
>
> >
> > On 5/23/07, William Stein <[EMAIL PR
ich is initialized in the
> constructor.
Strong +1 for this. I can't believe we don't already have it :-)
Not sure I would want it called _unit_ though, makes me think rather
of invertible elements. How about _one_, or _unity_?
david
--~--~-~--~~~---~
hy as simple as possible. For now it might be
better to just put the _one_ attribute on CommutativeRing.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
F
Works fine for me.
On 5/24/07, William Stein <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> If you use an intel-based mac, could you possibly try out the dmg that
> I've posted here
> and let me know if it works for you:
>
> http://www.sagemath.org/incoming/
>
> It is supposed to be the case that wh
ion
To: David Joyner <[EMAIL PROTECTED]>
Cc: maxima <[EMAIL PROTECTED]>
On Wed, 2007-05-23 at 22:30 -0400, David Joyner wrote:
> Thanks but just to be clear, I'm interested in knowing whether or not
> there is a
> command such as
>
> plot3d (2^(-u^2 + v^2), [u, -3, 3]
clusion into sage? See
>
> http://wis.kuleuven.be/algebra/hubrechts/
It looks like he has implemented it only in MAGMA. So for inclusion
in SAGE, it would need to be re-implemented in one of SAGE, python,
pyrex, C, C++ etc.
David
--~--~-~--~~~---~--~---
en the divisor d is
negative, i.e. it returns a negative remainder. I would prefer the
remainder always be in [0, abs(d)). For positive divisors it seems
mathematically sane. In fact I would prefer that it doesn't work at
all for negative divisors. Depends what you&#x
rised"
denominator (bc)(be)? Is this still true even if b is quite a large
object compared to a, c, d, e?
And I assume if you have a fraction a/b, where the system has
remembered some factorisation information about b, then if you compute
1/(a/b) it throws that information away?
david
On May 27
he Factorization class already
supports arithmetic, I don't know.)
Then you would just write
K = FractionField(S)
Would it even be necessary to write special code in the fraction field
class if it was done this way? (Hmmm thinking aloud in public
here)
David
--~--~---
t; rather than "cacheing" :-))
Qualification: obviously, if this ever gets integrated with the
FractionField constructor, it should be only *optional*... I would
expect there would be many applications where the caching would
actually slow things down. What do you think about this?
7;
> which
> when true returns an instance of FractionField_cache instead of
> FractionField_generic.
I think having a flag like that sounds very reasonable.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
ents would be greatly appreciated. Please be as critical as you like.
- 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 thi
graphy, this would be a valuable
> contribution.
I second this. Would be great to have a fast implementation. In
particular there are supposed to be very fast algorithms for genus 2,
and perhaps 3 too.
david
--~--~-~--~~~---~--~~
To post to this group, se
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, 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 w
es of ciphers and hashes. Many of
the latter
algorithms, and fast algorithms for RSA, ElGamal, and ECC have
implementations
in standard libraries, but as noted, scaled down "weak" versions would
be useful
for testing or demonstrating attacks.
--David
On May 29, 10:08 am, David Harvey &l
ficult to reach a reliable conclusion about how
> the detailed implementation of this algorithm will actually behave in
> particular circumstances."
Wow. I can't believe they actually said that. What incredible
arrogance. I think this in itself demonstrate
Thank you all for your great comments. I'm working on a new draft
now. You all have provided very useful suggestions.
On 5/29/07, Mark van Hoeij <[EMAIL PROTECTED]> wrote:
> David, William,
>
> Thanks for getting started with this whitepaper project. I think that
> what
William Stein wrote:
> On 5/29/07, Jason Grout <> wrote:
>> I noticed that the topic of plots in sage has come up recently in
>> mailing lists. Two options that I've used that I didn't see mentioned
>> anywhere are listed below. These don't have python bindings, but may be
>> interesting to cons
ive after all. That said, it's well worth investigating
> asymptote further, especially given that it is GPL'd.
>
> William
Another reason to add asymptote is to be able to nicely print things like
commutative diagrams. I'm not saying
Reported, banned, and deleted.
On 5/31/07, DAVID <[EMAIL PROTECTED]> wrote:
>
> welcome to http://www.nikesn.com/.
> Products: Nike shoes
> We are specialized in Nike shoes manufacturing,such as Jordans1-21,
> Shox Series,Air Max Series,Air Force one,Dunk,Rift and so on.
deleted, banned, reported.
On 6/1/07, green <[EMAIL PROTECTED]> wrote:
>
> Despite having worked with a laptop day in day out, I only landed up
> with aching wrists, strained neck and back; with my work still
> pending. I could quote several reasons for it - my laptop processor
> runs too hot, m
AGE matures I hope the doctest
coverage gets *much* more systematic and complete, especially with
regard to border cases, and as you point out, we might not always
want this cluttering the examples section.
david
--~--~-~--~~~---~--~~
To post to this group, send ema
I'm not sure that exceptly the intended input and output would be.
Does one want symbolic computations of group elements?
Manipulation of root data? (LiE does some fo that:
http://www-math.univ-poitiers.fr/~maavl/LiE/. BTW, I wrote
Marc van Leeuwen some time ago and asked if it was GPL'd. He didn
On sage.math, when I run the default install of sage, I get
[ ... ]
: /home/was/s/local/lib/python2.5/site-
packages/sage/libs/ntl/ntl.so: undefined symbol:
ZZX_square_free_decomposition
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage
e (a la Vogan) for
> tempered reps with real infinitesimal character, and maybe use the
> Blattner formula for other K-types. In order to deal with
> nonconnected maximal compact subgroups, some new data types might be
> necessary - I'm not an expert in this. The package should reco
FYI (forwarded from the SciPy list)
+
Dear SciPy users:
I would like to let the users of the SciPy ODE solvers know about
a tool that I have developed called VFGEN. VFGEN is a program
that takes a specification of a vector field (in other words, a
sy
are concerned, SAGE has GAP wrappers for the
finite classical groups. I wonder if analogous GAP wrappers for the
corresponding Lie algebras would be useful for your project.
>
> I'll keep on considering these things over the summer.
>
> - Marty
>
> On Jun 3, 10:54 am, &quo
point to the wiki on sage.math.
If there is no objection, i will fix them by replacing sage.math with
sagemath.org.
- David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
he radical change introduced
with the new features for symbolic algebra (I think for version 2.4).
The design has in mind an undergraduate calculus audience. There was
little comment on this subject, but after using it a bit and seeing
some of the consequences, I would like to reopen this discussion
ad to
be corrected
that no funny business with the language is going on. I argued
against R and Z
being predefined at the reals and integers, and on the same basis
would do so for
symbolic variables.
The x(x-1) typo is a good pitfall to be aware of.
--
Michel wrote:
> It has often bothered me that there is a big difference in
> performance between
> next_prime(...) and
> (...).next_prime()
>
> I.e. try (...)=2^4096.
>
> Looking at the source code I see that the first gives (by default) a
> provable
> result, whereas the second gives a probab
On Jun 7, 2007, at 11:58 AM, Michel wrote:
> And what should the default be? I would vote for probable primes
> since looking for provable primes is unbearably slow.
Agree.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage
and next_prime(2^4096,method = "default")
have the same behaviour but next_prime(2^4096,method = "other")
has the other one. Since it doesn't matter to me, I'd ask
William what he wants for the default, or wait until more people
vote.
>
> Michel
>
>
&
On Jun 7, 2007, at 1:57 PM, Robert Bradshaw wrote:
>
> On Jun 7, 2007, at 9:03 AM, David Harvey wrote:
>
>> On Jun 7, 2007, at 11:58 AM, Michel wrote:
>>
>>> And what should the default be? I would vote for probable primes
>>> since looking for provable
On Jun 7, 2007, at 2:19 PM, William Stein wrote:
> On 6/7/07, David Harvey <[EMAIL PROTECTED]> wrote:
>>> I agree too, though I think is_prime should remain provably correct.
>>
>> I disagree. I think is_prime should have the same option available,
>> and
Hamptonio wrote:
> Hi,
>
> I was just at the SIAM dynamical systems meeting in Snowbird, and it
> got me curious about how support for dynamical systems could be put
> into sage. Unfortunately, the research I was presenting was done
Maxima already has some material on dynamical systems
http://f
Why not just use what Martin has for the front, but with
"www.sagemath.org" below it? That;s B+W.
On 6/12/07, Craig Citro <[EMAIL PROTECTED]> wrote:
>
>
> > > That's pretty neat. It would be better if http://www.sagemath.org
> > > appeared somewhere on the shirt.
> >
> > +1 to this shirt! Perh
ts/numbertheory/number_fields
David Roe
--~--~-~--~~~---~--~~
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.com/group/sage-d
On 6/12/07, Craig Citro <[EMAIL PROTECTED]> wrote:
> hey all,
>
> so here are three ideas for the sd4 shirt, called flier.pdf,
> flier_plain.pdf, and flier2.pdf in:
>
> http://sage.math.washington.edu/home/citro/sd4_shirt/
>
> They're all basic variations on the sagemath.org flier, with the key
>
Not much help, but it installs for me as well (on an intel macbook).
Good job!
+++
On 6/13/07, Robert Miller <[EMAIL PROTECTED]> wrote:
>
> Would anyone like to try to install
>
> http://sage.math.washington.edu/home/rlmill/leon-0.1.spkg
>
> ?
>
> It builds and i
of the ntl wrapper, one thing
I'd love you to keep in mind is NTL's global modulus business. I've never
been convinced that this was fixed properly in SAGE.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.co
As a minor tangential remark, there is now a tutorial for creating
sqlite databases at
http://www.sagemath.org:9001/sqlite-tutorial
+
On 6/16/07, Jonathan Bober <[EMAIL PROTECTED]> wrote:
>
> Here is a amusing, but real, snippet from a running sage ses
reported+deleted (both emails), and banned
On 6/16/07, adeel <[EMAIL PROTECTED]> wrote:
>
>
> Top Selling Magazines Of The World
> For Pet & Animal:
> http://www.moreinfo247.com/9639913/Department.vstore?
> id=35">https://www.sfimg.com/Images/Banners/banner205.gif";
> border="0"/ >
> For Computer
s set-up and comment.
Any thoughts on this idea?
- David
--~--~-~--~~~---~--~~
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.
doesn't belong there.
david
--~--~-~--~~~---~--~~
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.com/group/sage-devel
UR
Hi:
Some SD4 photos at posted at
http://sage.math.washington.edu/home/wdj/sd4photos/images.html,
or at least they will be in 5 minutes or so.
- David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this
Sorry about that! Should be fixed in a few minutes.
On 6/19/07, Michael Abshoff
<[EMAIL PROTECTED]> wrote:
>
> David Joyner wrote:
> >
> > Hi:
> > Some SD4 photos at posted at
> > http://sage.math.washington.edu/home/wdj/sd4photos/images.html,
> > o
deleted, reported, and banned.
Incidently, there is an option "Messages from new members are moderated"
which I can set. This means that new members might have a delay to their
posting. Any thoughts? It would eliminate spam I think.
On 6/19/07, jobs 6677 <[EMAIL PROTECTED]> wrote:
>
>
> Hi,
>
>
Done (for all three groups).
On 6/19/07, William Stein <[EMAIL PROTECTED]> wrote:
>
> On 6/19/07, David Joyner <[EMAIL PROTECTED]> wrote:
> >
> > deleted, reported, and banned.
> >
> > Incidently, there is an option "Messages from new members are
Deleted, banned, reported.
This person joined a week ago or so, therefore presumably does not
qualify as "recently joined" and hence moderated. The next level is
probably to require all people joining the list to get an invitation.
There are 2 options:
(1) must be invited by the owner,
(2) must b
+
On 6/20/07, kaimmello <[EMAIL PROTECTED]> wrote:
>
> There isn't an option that the first (only the first) post or comment
> has to be approved by a moderator?
> There is for example in Wordpress and has saved me from a lot of spam
> on my blog!
> Regards
>
what happens if a parent (say vectors over some ring)
has more than one way of representing elements. Is Vector.__mul__
responsible for the conversion in this case, or is it the vector/
matrix multiply operation?
david
On Jun 21, 2007, at 3
How does one register to use it? Or does our sage.math login
and password work?
On 6/21/07, William Stein <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> I spent the last 3 days synthesizing the ideas from the workshop and writing
> a lot of code and have put together the first version of the "SAGE Note
illiam Stein <[EMAIL PROTECTED]> wrote:
>
> On 6/21/07, David Joyner <[EMAIL PROTECTED]> wrote:
> >
> > How does one register to use it? Or does our sage.math login
> > and password work?
> >
>
> It's simple -- like most online sites. Just click o
n Firefox 2.0.0.4 on my G4 Powerbook, and I can't
> create a new worksheet. Every time I hit the button to create a new
> worksheet, I get brought right back to the login page. In fact, it
> seems to do exactly that for every button I hit.
That happened to me the first time I hit &quo
I wish it could be resized without pixelization to get more detail on the
screen. Still audio is excellent and it's better than audio only.
===
On 6/22/07, William Stein <[EMAIL PROTECTED]> wrote:
>
> What do you guys think of this video:
>
> http://sage.math.washington.e
tch since it is currently not
implemented as a CubeGroup module method. Maybe by late romorrow.
I was hoping to use Tachyon but I couldn't find some features I needed
so I didn't get
far with it.
- David
--~--~-~--~~~---~--~~
To post to this group, send e
On Jun 26, 2007, at 8:39 AM, Martin Albrecht wrote:
>
> Hi there,
>
> I have given some thought to finite extension field isomorphisms
> and finite
> extension field embeddings.
Before you get too deeply into this, you should also discuss this
with David Roe (and possibl
701 - 800 of 6542 matches
Mail list logo
