It worked for me.
David
On Jan 6, 2008 1:08 AM, Joshua Kantor <[EMAIL PROTECTED]> wrote:
>
> Hello. for the dvd we are including a dmg file. There was some
> problems with the initial version of this. I believe the following is
> working,
> but if anyone else could te
I got the error: :the following disk images failed to mount"...
Could be a corrupted download?
On Jan 6, 2008 1:08 AM, Joshua Kantor <[EMAIL PROTECTED]> wrote:
>
> Hello. for the dvd we are including a dmg file. There was some
> problems with the initial version of this. I believe the following
> > David, can you test the md5sum of the downloaded .dmg file.
> > At the terminal
> > md5
>
> FWIW, I get:
>
> MD5 (/SandBox/DownLoads/sage-2.9.2-osx10.4-intel-i386-Darwin.dmg) =
> 7bdaf64293d8136aa0d59c89b894ca79
>
I get the same:
MD5 (sage
Did you try vlc?
On Jan 7, 2008 2:04 AM, TimDaly <[EMAIL PROTECTED]> wrote:
>
> I'm unable to view this using RealPlayer, Quicktime, or mplayer on
> XP, OSX, or Linux. None of the sites have the codec available.
> Any idea where I can find the codec for one of these tools?
>
> Tim
>
> On Jan 7, 1
I'll be able to drive in with a car, carrying mugs, etc. I wonder how many
t-shirts are sold by vendors, on average?
On Jan 7, 2008 11:50 AM, mhampton <[EMAIL PROTECTED]> wrote:
>
> In thinking about the sage booth at the jmms this morning, it occured
> to me that in the future it might be nice t
haracter
table library package. In any case, what should I do? Should I inform
Thomas? Would, for example,
1. Unpack the spkg,
2. run touch -r * in the top directory (I don't know if this is even legal),
3. repack,
4. repost the spkg
solve the problem
r with a class of rings with involution
(from
which CC, quadratic rings, cyclotomic rings, and a class of CM
fields
would
inherit).
--
David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send
tes a list of substrings that are separated
by a given separator, and the default separator is whitespace.
See the documentation on RDF to see if you want to use that, or RR or
something else.
David
On Jan 10, 2008 11:42 AM, myFalc <[EMAIL PROTECTED]> wrote:
>
> Hello!
> I&#x
I agree with Didier's comments.
Judging from emails to the GAP support list
(Which also has such a function), a block matrix function will be
frequently used.
I think it should be well-documented.
On 1/10/08, didier deshommes <[EMAIL PROTECTED]> wrote:
>
> On Jan 9, 2008 3:23 AM, Robert Bradshaw
First, I know essentially 0 about DFAs. However, I noticed that your
"well-documented Python library" contained no examples at all
and no references to the literature, except for the blurb:
"""...
See "Minimal cover-automata for finite languages" for context
on DFCAs, and
"A
t-quite-right to me,
but I can't think of a better way.
* "Google source code system.", -- the punctuation here is wrong. I
think it should be "Google source code system," said ...
Stein bio:
* 284 page => 284 pages
* the paper on computation of p-adic heights
Thanks Ifti. I posted some of my shots to
http://sage.math.washington.edu/home/wdj/sagedays/ams2008/images.html
On Jan 11, 2008 11:23 AM, Iftikhar Burhanuddin <[EMAIL PROTECTED]> wrote:
>
> Hi folks,
>
> My pics from the annual AMS meeting in San Diego (1/8/8) are available
> here:
>
> http://sa
Build successful on mac OS 10.4.10, ppc G5. Didn't run doctests due
to known issue with combinatorics stuff.
david
On Jan 11, 2008, at 3:24 PM, mabshoff wrote:
>
> Hi,
>
> Sage 10.2.alpha2 is out. The main change is the switch
> of python to ucs4. If you don't know w
making a CompleteIntersection class eventually.
David
On Jan 14, 2008 8:38 AM, D. Benjamin Antieau <[EMAIL PROTECTED]>
wrote:
> To all,
>
> I've created a sage file to calculate, among other things, the Hodge
> numbers of an arbitrary complete intersection. Attached is the .sage fi
(moved over from sage-support...)
On Jan 14, 2008, at 10:28 PM, David Harvey wrote:
> What would be *really* nice is if we could work directly in the
> fraction field of the quotient of R. by the
> appropriate ideal. (Does that even make sense? Is the ideal prime?) I
> tried to do t
quot;
for the coordinates of (P1 + P2) + P3 is the same as the formula for
P1 + (P2 + P3). Would this constitute a correct verification of
associativity (perhaps modulo problems caused by the point at infinity)?
> I tried doing this in Magma some time ago, using something like David
>
the curve
up to E/L and think of P as a point on E/L. For example P doesn't
have any non-trivial galois conjugates any more. To retain these you
need to "remember" that the curve is actually defined over K.
david
--~--~-~--~~~---~--~
There was a thread on multiple return values coming from Magma,
since renamed to "Integer points on conics"
William pointed out that one can access the multiple return values
using nvals:
x = magma.XGCD(15, 10)
x,y,z = magma.XGCD(15, 10, nvals = 3)
The first returns an integer, while the seco
GPL in France.
--David
- Forwarded message from Sylvain Chevillard
<[EMAIL PROTECTED]>
-
Date: Tue, 15 Jan 2008 13:01:15
+0100
From: Sylvain Chevillard <[EMAIL PROTECTED]
lyon.fr>
User-Agent: Icedove 1.5.0.10
(X11/20070329)
To: [EMAIL PROTECTED]
im.fr,
"[EMAIL PR
for floating point
code development.
http://sollya.gforge.inria.fr/
I wonder if it could be useful for the NIST special function stuff Dan
Lozier was discussing in San Diego at the SAGE booth?
2008/1/16 David Kohel <[EMAIL PROTECTED]>:
>
> Here is another open source CAS, which is be
On Jan 15, 2008 11:50 PM, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Jan 16, 5:23 am, gri6507 <[EMAIL PROTECTED]> wrote:
> > I've posted several thread on this topic now - mostly with question.
> > But now, with the help of several members in this forum, I finally
> > have my first release of
tourplot. It might also be possible to plot the solution to
the 1st order DE y' = - F_x(x,y)/F_y(x,y). Suggestions?
- David Joyner
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send ema
Note that I just put up a ticket with patch (1795) that fixes sage-coverage
so that it checks cdef'd and cpdef'd functions and classes.
David
On Jan 16, 2008 12:00 PM, Martin Albrecht <[EMAIL PROTECTED]>
wrote:
>
> On Wednesday 16 January 2008, mabshoff wrote:
> >
My modification to sage-coverage checks to see that doctests are present in
the docstring of a cdef'd function but doesn't check that the function name
is there (because it usually won't be).
David
On Jan 16, 2008 2:24 PM, Nick Alexander <[EMAIL PROTECTED]> wrote:
>
>
functions seem
> to be redundant with the doctests exposed functions.
The indirect doctests are sometimes reduntant. But sometimes they are
things like _add_c_impl, which won't necessarily get doctested elsewhere.
David
--~--~-~--~~~---~--~~
To post
With the modifications, our overall coverage is at 33.1%.
David
On Jan 16, 2008 2:56 PM, mabshoff <
[EMAIL PROTECTED]> wrote:
>
>
>
> On Jan 16, 8:51 pm, "David Roe" <[EMAIL PROTECTED]> wrote:
> > > Of course, it'd be nice if every function had am
On Jan 16, 2008 3:11 PM, Jason Grout <[EMAIL PROTECTED]> wrote:
>
>
> David Joyner wrote:
> > Hi:
> >
> > I don't remember this topic coming up before but at some point
> > it must be faced since it arises in Calculus 1. AFAIK, SAGE has no routi
ff(y(x), x, 1) == (2 - x)/y(x)]
It seems sympy has some nice symbolic functionality that is missing
in SAGE but this type of example is all I really need. Thanks again.
On Jan 16, 2008 2:14 PM, Ondrej Certik <[EMAIL PROTECTED]> wrote:
> On Jan 16, 2008 7:00 PM, David Joyner <[EMA
I don't understand what is going on with this patch. I'm wondering if
it would be worthwhile creating a new patch based on a different version of
SAGE? If so, should I use sage-2.10.alpha* or ...?
+
On Jan 16, 2008 5:17 PM, SAGE <[EMAIL PROTECTED]> wro
tch
posted to
http://sagetrac.org/sage_trac/ticket/1544
This typo is however still in the docs for sage-2.10.alpha1, so I am
confused...
On Jan 17, 2008 7:04 AM, David Joyner <[EMAIL PROTECTED]> wrote:
> I already corrected this in a patch I sent in a few weeks ago now.
>
>
>
>
I already corrected this in a patch I sent in a few weeks ago now.
On Jan 17, 2008 1:39 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> -- Forwarded message --
> From: Matthew Moelter <[EMAIL PROTECTED]>
> Date: Wed, 16 Jan 2008 22:16:00 -0800
> Subject: typo in tutorial
> To: [
, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Jan 17, 2:42 am, "David Joyner" <[EMAIL PROTECTED]> wrote:
>
> Hi David,
>
> > I don't understand what is going on with this patch. I'm wondering if
> > it would be worthwhile creating a
could do
G = Aut(E1) # or Iso(E1,E1)
G.group()
G.group_with_isomorphism()
A = AbelianGroup(2)
A.is_isomorphic(G)
A.is_isomorphic_with_isomorphism(G)
A.isomorphism(G)
Again, this should be a common syntax throughout SAGE.
--David
As long as there are examples
> and documentation this is easy
y, but then I'm the
one that originally made the design decision, so
David
On Jan 17, 2008 9:52 AM, David Harvey <[EMAIL PROTECTED]> wrote:
>
> Hi folks (especially william + robert + david roe),
>
> I showed up for Doc Days 1 and started looking at the infi
Hi folks (especially william + robert + david roe),
I showed up for Doc Days 1 and started looking at the infinity and
extended integer ring stuff.
Question: why does the "unsigned infinity ring" not have a zero
element, whereas the "(signed) infinity ring" has a zero?
> I will try to take all the above on board as I am implementing it, and
> look forward to having you people make constructive criticisms
> But David K's suggestion about the set of all iso/automorphisms might
> wait until the next round.
I (or someone else) can implement
On Jan 17, 2008 8:15 AM, mabshoff
<[EMAIL PROTECTED]> wrote:
>
>
>
> On Jan 17, 11:39 am, Robert Bradshaw <[EMAIL PROTECTED]>
> wrote:
>
> Hello,
>
> > transform.pyx does some maxima stuff, perhaps the patch (or some
> > combination with other patches) is leaving maxima in an unstable state?
>
> I
On Jan 18, 2008 9:48 AM, Jaap Spies <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> The following is working on Fedora 7/8:
>
> > Dependencies for Sage:
> >
>
> > - http://www.wxpython.org wxPython-2.6.x or higher for the UI
> > - vtk-5.0.3
> > - setuptools-0.6b
>
> 1) Install wxPython-2.8.7.1:
On Jan 18, 2008 9:45 AM, Ondrej Certik <[EMAIL PROTECTED]> wrote:
>
>
> On Jan 18, 2008 3:40 PM, David Joyner <[EMAIL PROTECTED]> wrote:
> >
> >
> > On Jan 18, 2008 9:23 AM, Ondrej Certik <[EMAIL PROTECTED]> wrote:
> > >
> > > Hi F
On Jan 18, 2008, at 11:32 AM, William Stein wrote:
>> Let A be a matrix not over ZZ or QQ:
>>
>> A.adjoint()
>> A.inverse()
>>
>> are not implemented.
>
> I don't think they should be. There are already (at least) 3 ways
> to do this:
On Jan 18, 2008 9:23 AM, Ondrej Certik <[EMAIL PROTECTED]> wrote:
>
> Hi Fabio,
>
> On Jan 18, 2008 11:51 AM, Fabio Tonti <[EMAIL PROTECTED]> wrote:
> > Hello everyone,
> >
> > I've just been playing around with SymPy a bit more lately, and I found that
> > the 3D-Plot implementation is really nic
s private e-mail anymore but the
> mailinglist
> * the URLs are outdated => http://www.sagemath.org
>
> so this text could also be updated/edited/removed.
>
> Maybe the frontpage of http://www.sagemath.org would be a nice starting point
> for a translation/a new intro?
error. You only do this when it makes sense. E.g., if A is a
> matrix
> with integer entries, there is a reasonably natural place in which to
> compute the inverse of A, namely matrices over the rationals. To say,
> "sorry
e invariants, sorted. In
> which case the invariants is listed above are wrong!
>
> The Sage version of this is all explained in the documentation in file
> sage/groups/abelian_gps/abelian_groups.py, attributed to David Joyner
> . Please will all the algebraists out there tell me
It's at
http://wiki.sagemath.org/A_short_introduction_to_SAGE
I updated it a bit a few days ago but it could use more editing.
On Jan 20, 2008 2:51 PM, Alfredo Portes <[EMAIL PROTECTED]> wrote:
>
> On Jan 20, 2008 2:25 PM, Alfredo Portes <[EMAIL PROTECTED]> wrote:
> > Same can be said for http://
lds, one could set GF(q).gen() to be such a
generator. This could either be convenient, or confuse users into
thinking that this is more generally True.
--David
P.S. On the other hand, I find (additive) order confusing and there
should
be some checking of the index for FF.i below (i.e. give an e
On Jan 21, 2008 1:58 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Jan 20, 2008 10:50 PM, Timothy Clemans <[EMAIL PROTECTED]> wrote:
> >
> > The message that started this is
> > http://en.wikipedia.org/wiki/Wikipedia:Possibly_unfree_images/2008_January_21#Image:Sagecontourplot.png
> >
> > If
On Jan 22, 2008 5:05 AM, Ted Kosan <[EMAIL PROTECTED]> wrote:
>
> William wrote:
>
> > > If further testing is successful, I would like to have simpleJSON
> > > included in SAGE. What procedure do I need to follow in order to make
> > > an official software addition request?
> >
> > (1) Convince
an arbitrary finite algebraic extension
field, where it is
defined to be a generator of the field extension.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
n (co-chair), Rand Corporation ([EMAIL PROTECTED])
- Mark Giesbrecht, ACM SIGSAM Chair, University of Waterloo
([EMAIL PROTECTED])
- David Musser, Rensselaer Polytechnic Inst ([EMAIL PROTECTED])
- Mike Dewar, Numerical Algorithms Group ([EMAIL PROTECTED])
All nominations and supporting papers should be
ended
rationals.
David
On Jan 24, 2008 12:48 PM, Burcin Erocal <[EMAIL PROTECTED]> wrote:
>
> Hello,
>
> Today I witnessed a mathematica user struggling with Sage because of
> the way Sage handles infinity. On trac #1915 you can see an example.
>
> On Thu, 17 Jan 20
18:33:11 -0500
>From: "Hurt, Norm E."
>Subject: modular forms of weight one
>To: "David Joyner"
>
> Dear Prof. Joyner, I have one more question on
> modular forms of weight one. In the octahedral case
> Serre (2003) has expressed N_p(f)
On Jan 24, 2008 4:45 PM, William Stein <[EMAIL PROTECTED]> wrote:
>
> On Jan 24, 2008 9:06 AM, David Joyner <[EMAIL PROTECTED]> wrote:
> >
> > (This was posted to the SIGSAM list. Posted here FYI.)
> >
> > 2008 CALL FOR NOMINATIONS
> >
> &
odifying the
object in place. But that seems to be a design decision that the
user-defined ideal generators are not an immutable attribute of
the ideal, so GroebnerBasis also changes the ideal generators
in place.
--David
--~--~-~--~~~---~--~~
To post to this group, s
My wild guess, knowing nothing at all about what you are trying to do,
is that either you have a import problem of some type. In any case,
I would try cutting out the new code and putting it in a test.sage
file then using
attach to check for errors.
On Jan 25, 2008 12:09 PM, John Cremona <[EMAIL
ou're right, I wasn't very coherent.
What I think I meant was to quickly compute the top few *binary*
digits of "compare". The reason for this is that everything is stored
internally in binary, so it's very easy to read off the top few
*binary* digits of "self&quo
On Jan 27, 2008, at 10:55 PM, David Harvey wrote:
>> We actually know what the first few digits (or, actually, all of
>> them)
>> of *compare* are: 1000...
>
> Sorry, you're right, I wasn't very coherent.
>
> What I think I meant was to quickly
This doesn't answer your question but might provide a temporary workaround:
sage: P = list_plot([Q(1+i/100) for i in srange(900)])
sage: show(P)
On Jan 27, 2008 9:39 PM, Jonathan Bober <[EMAIL PROTECTED]> wrote:
>
> Does anyone know what's going on in the following example? I can't seem
> to rep
On Jan 28, 2008, at 6:47 PM, Alex Ghitza wrote:
> OK, I'm quite happy with this (thanks David for suggesting it
> and Carl for telling me how to do it!)
>
> I've put this in and played around with it. It is definitely
> *much* faster for the huge examples that I tr
Hi:
I don't use the notebook but thought that possibly those
who do development might want to check out
http://developer.yahoo.com/yui/
It's BSD licensed, and I'm guessing might have some useful code.
- David Joyner
--~--~-~--~~~---~--~~
To pos
That's cool. Good luck on your talk.
BTW, have you tried this?
http://www.math.pitt.edu/~bard/xpp/xpp.html
I could not get it to compile from source but fortunately
is a debian package (apt-get install xppaut). The docs say it
"is a tool for solving
* differential equations,
* differenc
copy of the Sage tutorial at http://
> www.lulu.com/content/1932117
>
> I will be publishing a DVD there too as soon as I can get the iso to
> upload.
>
> - Robert
>
>
> On Dec 28, 2007, at 1:06 PM, William Stein wrote:
>
> > On Dec 27, 2007 5:58 AM, David Joyne
;
> http://groups.google.com/group/sage-support/browse_thread/thread/133be6e1519eeb0d).
>
> Check out especially the ultra cool Rubik's cube example, thanks to
> David Joyner.
>
> Yours,
>
> John Voight
> Assistant Professor of Mathematics
> University
I'm not sure if this helps or not.
All I can find is a Maxima package, diff_form.mac, which may or may not
be loaded in SAGE:
http://maxima.cvs.sourceforge.net/maxima/maxima/share/diff_form/
This email
http://www.ma.utexas.edu/pipermail/maxima/2006/003145.html
might help explain what it does. The
What kinds of geometric objects do your forms live on? Algebraic curves and
varieties? Manifolds? Manifolds with boundary?
David
On Feb 1, 2008 8:00 AM, Peter Storm <[EMAIL PROTECTED]> wrote:
>
> Hello,
>
> I would like to either develop or find a method for computing w
cts of Infinite Groups (ed. Ben Fine),
published by World Scientific Press.
3. (with David Kohel)
http://sage.math.washington.edu/home/wdj/expository/";>"Groups
and SAGE". Provisionally accepted for Applications of
Computational Group Theory (tent. title), AMS
"Contemporary Mathema
Hi:
Maybe most people know this but just in case, here is a
slashdot article on Python 3.0. I'm wondering if there is a simple
summary of what types of commands will change in 3.0.
- David
++
| Python 3.0 To Be Back
I'm very sorry this got through. My fault, as I was half-asleep and clicking
buttons too quickly. He has been banned and the message removed from the
archives. - David Joyner
On Feb 5, 2008 6:51 AM, uzmar <[EMAIL PROTECTED]> wrote:
>
> Another Homosexual Fantasy
> by SkinDi
am lazy:-).
On Feb 5, 2008 11:59 AM, William Stein <[EMAIL PROTECTED]> wrote:
>
> Hi,
>
> I would like to propose again that we deprecate the
>
> sage -upgrade
>
> functionality for "normal end users". It was definitely never
> meant to be use
ebook can be released under a CC license.
>
> http://en.wikipedia.org/wiki/Wikipedia:Possibly_unfree_images/2008_January_21#Image:Sagecontourplot.png
>
> On Jan 21, 4:30 am, "David Joyner" <[EMAIL PROTECTED]> wrote:
> > On Jan 21, 2008 1:58 AM, William Stein <[EMAIL P
octest_arith.py
[5.2 s]
exit code: 256
What is going on here?
(I ran into this while trying to write a patch for http://
sagetrac.org/sage_trac/ticket/2128)
This is an intel macbook, OS 10.4.11.
david
--~--~-~--~~~---~--~~
To post to this group, send emai
er hack", which is much more confusing
to me, is that it gets applied for any line containing the string
"random"!! That's totally unexpected and weird. i.e. I could live with:
sage: some_func(5) # random
234736
where it's cleare
Hello all:
Perhaps the following discussion (from emails, edited out for
easier reading by SAGE developers) could lead to a PEP?
David Kohel:
I wonder if (1) Permutation could/should be not be imported
into SAGE, or (2) if a single permutation class could/should be designed
and used. This
can have a parameter check, by default True, which is able to
disable this checking.
Let me know if you have more questions.
And for those of you out there interested in coercion, I'll have my bundle
posted as soon as I get a chance to tie off some loose ends.
David
--~--~-~--~
On Feb 12, 2008, at 8:32 PM, Nick Alexander wrote:
> Do others agree that cyclotomic_polynomial should be over ZZ? If so,
> I will fix it.
Absolutely.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsub
an be made as
light as the implementation you have, but as efficient as the cython
coded permutations for the arithmetic of the group law and group
actions.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe
we could then plug into a cython class to
perform the arithmetic.
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 ht
group order, and pathologies like non-cyclic
groups, should not be
omitted by focusing on large prime order groups.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PRO
t see how you can restore a previous state. (well I
suppose you could just call SetSeed again and count the number of
previous calls you made to Random() :-))
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscrib
action_on_vector(g,G)
[1 0 0 0 1 1 0]
[0 1 0 1 0 1 0]
[0 0 0 0 0 0 1]
[0 1 0 1 0 1 0]
[0 0 0 0 0 0 1]
[1 0 0 0 1 1 0]
AUTHOR: David Joyner, licensed under the GPL v2 or greater.
"""
V = v.parent()
n = len(list(v
This is doctest where the result used to be
Traceback (most recent call
last):
...
TypeError: cannot create a p-adic out of
but after the p-adics patch it started working and returning p. I looked at
it briefly and couldn't figure out why it was doing so.
David
On Fri, Feb 15, 2008 at
)
sage: S5 = SymmetricGroup(5)
sage: g = S5([(1,2,3)])
sage: A; perm_action(g,A)
[1 0 0 0 1 1 0]
[0 1 0 1 0 1 0]
[0 0 0 0 0 0 1]
[0 1 0 1 0 1 0]
[0 0 0 0 0 0 1]
[1 0 0 0 1 1 0]
AUTHOR: David Joyner, licensed un
On Fri, Feb 15, 2008 at 9:57 PM, Jason Grout
<[EMAIL PROTECTED]> wrote:
>
>
> David Joyner wrote:
> > On Fri, Feb 15, 2008 at 12:43 PM, John Cremona <[EMAIL PROTECTED]> wrote:
> >> I think both/either of these are useful enough they should be
> >&g
rd rho algorithms available, and it should be
possible
to use exponent or group order bounds, exact group exponents and
orders,
and factored group orders, when this information is available.
--David
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@go
On Feb 15, 2008 9:57 PM, Jason Grout <[EMAIL PROTECTED]> wrote:
>
>
> David Joyner wrote:
> > On Fri, Feb 15, 2008 at 12:43 PM, John Cremona <[EMAIL PROTECTED]> wrote:
> >> I think both/either of these are useful enough they should be
> >> includ
FYI
-- Forwarded message --
From: Peter Horn <[EMAIL PROTECTED]>
Date: Feb 17, 2008 2:37 PM
Subject: [Om] OpenMath @ SCIEnce
To: [EMAIL PROTECTED]
Hello to the OpenMath Community!
The SCIEnce project (Symbolic Computation Infrastructure for Europe,
http://www.symbolic-computat
This is a feature of python that I don't completely understand, but
at least some documentation is here:
http://docs.python.org/ref/atom-identifiers.html
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscr
On Thu, Feb 21, 2008 at 3:30 PM, Ted Kosan <[EMAIL PROTECTED]> wrote:
>
> On the support list, a high school teacher (Jacob) wrote:
>
> > That would be a huge value to me. As a high school teacher, the
> > features of GeoGebra almost completely fill the void of "things I wish
> > sage coul
he range of good developers and also increasing the
> range of tools math researchers can bring to bare on attacking
> a problem results in better research. For example, the solutions
> to many problems in number theory involve
> an incredible range of techniques in different areas o
[all-recursive] Error 1
make[2]: *** [all] Error 2
failed to build GNUTLS
real1m54.769s
user0m53.751s
sys 1m20.593s
sage: An error occurred while installing gnutls-2.2.1.p1
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@goog
.gz
I am going to try building again now with -j1.
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.googl
are intended to demonstrate pitfalls of using
pow_mpz_t_tmp and pow_ZZ_tmp dangerously. Patch posted at 2259.
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
URLs: http://www.sagemath.org
-~--~~~~--~~--~--~---
On Fri, Feb 22, 2008 at 1:09 PM, Jason Grout
<[EMAIL PROTECTED]> wrote:
>
> Wow, this discussion blew up way to fast for me to keep on top of it and
> form a coherent opinion. Ted, I'm specifically CCing you; if you don't
> want to reply (either on or off list), I understand. Personally, I'd
On Feb 22, 2008, at 2:43 PM, mabshoff wrote:
> Hi David,
>
> I poked around in the install log and the issue is "Resource
> temporarily unavailable", i.e. the dreaded OSX resource limits that
> are too low. A suggested fix is at
>
> http://wiki.sagemath.org/Tips
s
>>> of the matrix who sum (exactly) to the vector 1,1,...,1.
>>>
>
> Isn't that exactly the same thing as solving
>
>M*x = [1,...,1],
>
> over GF(2)?
I think it's probably not mod 2.
david
--~--~-~--~~~---~--~~
much harder.
In particular, you don't get to use linear algebra because your arithmetic
isn't taking place over a field.
David
On Fri, Feb 22, 2008 at 4:10 PM, John Cremona <[EMAIL PROTECTED]>
wrote:
>
> The original problem said "binary matrix" so surely that me
On Feb 23, 2008, at 10:33 AM, Alex Ghitza wrote:
> David Harvey, http://arxiv.org/abs/0708.3404";>Efficient
> computation of p-adic heights (18 pages), 2007.
This will appear soon in LMS JCM.
http://www.lms.ac.uk/jcm/
> David Harvey, http://arxiv.org/abs/math/0610973";
ttp://trac.sagemath.org/sage_trac/ticket/756
http://trac.sagemath.org/sage_trac/ticket/753
http://trac.sagemath.org/sage_trac/ticket/1578
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from
_ZZ_pEX.pyx
libs/ntl/ntl_ZZ_pX.pyx
libs/ntl/ntl_ZZX.pyx
schemes/elliptic_curves/monsky_washnitzer.py
lfunctions/dokchitser.py
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
A friend of mine also pointed out the following, which uses Sage to compare
runtimes for different algorithms:
Dan Boneh, Craig Gentry, Michael Hamburg. http://crypto.stanford.edu/~dabo/pubs.html";>Space-efficient identity based
encryption without pairings (37 pages), Proceedings FOCS 200
101 - 200 of 6542 matches
Mail list logo
