-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Martin,
The link to which John pointed us gives a very easy way of computing the
trace over F_q algebraically, without floating point arithmetic. All we
need to do is put John's one-liner PARI code in. I would love to do
this, but I don't know h
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
In response to Harald's and Michael's (very enlightening!) posts, I
want to say a few words about educational use of Sage, from a slightly
different point of view.
I'm teaching mathematics at Colby College, a four-year liberal arts
undergraduate
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
There are instances in which Sage thinks that a one-dimensional space of
modular symbols is not simple, and it decomposes the space into a
one-dimensional and a zero-dimensional subspace:
sage: C=ModularSymbols(1,14,0,GF(5)).cuspidal_submodule(
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
I think Mathematica's official description is a very good example of
something we should *not* emulate. The title is simply nonsensical:
"the world's most powerful global computing system"? In what sense is
Mathematica a "global computing syste
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi William,
I'm sending you a bunch of small corrections, mostly minor, but the
kind of thing that might irk grant proposal readers :)
It looks impressive, and I hope it goes through.
Cheers,
Alex
In "Project Summary", third paragraph: "greatly e
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
The following is a bit confusing:
sage: f=(x-1)
sage: f.is_simplified()
False
sage: g=f.simplify()
sage: g
x - 1
sage: g.is_simplified()
True
Is this on purpose? I.e. if one had to describe what the function
is_simplified() is supposed to do,
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
David Harvey made some interesting suggestions on sagetrac about #1014
(implementing a number-of-digits function). I have some comments about
this and I decided it might be better to bring the discussion to
sage-devel; I'll try to summarize what
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
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 tried, and it's
also fast enough on smaller
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Fair enough. One could try to modify mpz_sizeinbase to accept
larger bases, although I'm not sure how easy it would be to
make it work with *arbitrary* bases. Anyway, this is a bit more
involved than what I'm willing to try now. It's definitely
som
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Robert Bradshaw wrote:
> I'm not a fan of the (seemingly arbitrary) 256 limit. Real
> intervals have been suggested, why not do something like
>
> def exact_log(x, base=10): x = abs(x) approx = floor(RIF(x).log() /
> RIF(base).log()) min, max = int(ap
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
OK, that's what I was wondering about. An integer with 2^53 binary
digits eats up 1024 terabytes,
so it's gonna be a while before we run into trouble. Besides, we
could have an optional precision
argument that defaults to 53 at the moment, but can b
Sorry for replying to my own email. If this still makes sense
when I get up tomorrow, I'll sit down and code it.
Alex
Alex Ghitza wrote:
> OK, that's what I was wondering about. An integer with 2^53 binary
> digits eats up 1024 terabytes,
> so it's gonna be a while before
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
This comes up in the pdf versions of the various documentation files:
the tutorial, the reference manual, the programming manual, the
constructions file.
When you have a long-ish line in a verbatim environment, and it exceeds
the width of the pa
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Jason Grout wrote:
> Alex Ghitza wrote:
>> -BEGIN PGP SIGNED MESSAGE-
>> Hash: SHA1
>>
>> Hi,
>>
>> This comes up in the pdf versions of the various documentation files:
>> the tutorial, the
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
John Cremona wrote:
| What's the exact rule for who gets emailed any changes to a trac ticket?
|
| I would be nice if anyone who had ever made a comment was added to the
| ticket's mailing list -- e.g. someone who has reviewed a patch.
| (Maybe this h
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
William Stein wrote:
| On Feb 17, 2008 12:41 PM, Alex Ghitza <[EMAIL PROTECTED]> wrote:
|> -BEGIN PGP SIGNED MESSAGE-
|> Hash: SHA1
|>
|> John Cremona wrote:
|> | What's the exact rule for who gets emailed any
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
This is really upsetting:
sage: plot(lambda x: x^(1/3), -5, 5)
-
---
Traceback (most recent call last)
/home/ghitza/colby/ma311/ in ()
/opt/sage/local/lib/python
fix in doctest
| #2236: Jason Grout: plot randomizes the endpoints of the interval and
|causes wiggling in the graph
| #2238: William Stein, Alex Ghitza: doctest failure in const.tex
|
| Merged in alpha1:
|
| #174: William Stein: Implement a modular Hermite Normal Form
| algorithm
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
The link for Mazur's paper "Finding meaning in error terms" is currently
http://www.ams.org/bull/-000-00/S0273-0979-08-01207-X/home.html
but it should be
http://www.ams.org/bull/2008-45-02/S0273-0979-08-01207-X/home.html
Best,
Alex
- --
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Patrick Ingram, http://arxiv.org/abs/0802.2651";>Multiples of
integral points on elliptic curves (29 pages), 2008.
Nicholas J. Cavenagh, Carlo Hamalainen, Adrian M. Nelson, http://arxiv.org/abs/0712.0233";>On completing three cyclic
transversals to
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I was going to point to trac tickets and comments by David Harvey, but
he beat me to the punch :)
Since I agree with what he already said, I'll just address one point:
Carl Witty wrote:
| 1) Do we really need three names for this concept? Could we
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi folks,
I made a first attempt at a bibtex() function for citing Sage
components. It returns a string containing either the citation
information in bibtex database format (i.e. what you would put in a .bib
file) or in bibliography format (i.e. what
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
David, thanks for bringing up the interaction with #2274. Mercurial
will definitely *not* like to merge the two doc patches, since I've made
some changes in the coding theory section (in the histogram example, for
instance, which we both noticed was
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Fallen Seraph wrote:
| The IRC channel suggested I post my related bug report here.
|
| Basically, using the "diff" function is giving me different, and
| equally wrong, answers depending on the sytax I use.
|
| The function I was interested in was:
|
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
I like the proposed plan.
I also agree with Nick on derivative() vs diff(), but since the plan
says that both will be around, I can probably live with that.
Best,
Alex
Nick Alexander wrote:
| As the author of the one of the patches, possibly so
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On a Dual Core machine running Gentoo, I've tried
./sage -tp 1 devel/sage/sage
and
./sage -tp 2 devel/sage/sage
Both appeared to run fine; the first used only one core and the second
used both. Running times: 1878 seconds for one core and 1031 s
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi all,
Martin Albrecht brought up the following issue, in relation to
http://trac.sagemath.org/sage_trac/ticket/2634
"I am not convinced that it is actually desired to allow 0 generators
for multivariate polynomial rings. We allowed that be
dshaw:
|transform.pyx calls matrix() with an RDF vector inside of a
|list instead of a flat list.
| #2698: John Cremona, Alex Ghitza: Small improvements to integer
|lcm, gcd on lists and a new xlcm function
| #2726: Tim Abbott: SAGE debian build system update
| #2729: Robert Bra
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Joel B. Mohler wrote:
|
| Since I was the last person to touch the digits method, I'll state my
case.
| Note that digits was (I think) inconsistent in this regard before my
| modifications -- I believe binary was different than other bases, but
I don'
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
William Stein wrote:
| On Thu, Apr 3, 2008 at 7:27 AM, Justin C. Walker <[EMAIL PROTECTED]> wrote:
|>
|> On Apr 3, 2008, at 03:38 , Jason Grout wrote:
|> >
|> > Currently, depending on the matrix type, there are several different
|> > ways to get
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi folks,
On Sunday we had an interesting discussion on #sage-devel about the
current implementation of fractional ideals in Sage. This was spurred
mainly by #821, but went beyond the issues in that ticket. I am going
to try to summarize the main p
aw: more speedups to cyclotomic polynomials
| #2848: Michael Abshoff: numerical noise in sage/misc/prandom.py
|on MacIntel OSX 10.5
| #2849: John Cremona, Alex Ghitza: Bug in elliptic curve
|cardinality for j=0 in char. 3
| #2852: Tom Boothby: ctrl-enter broken in firefox/linux
| #2853: Dan B
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
There are some inconsistencies in linear algebra over fields like CDF.
Some trouble was already reported in #2256. The following is another issue:
sage: M = matrix(CDF, 2, 2, [(-1 - 2*I, 5 - 6*I), (-2 - 4*I, 10 - 12*I)])
sage: M.is_invertible()
On the following machine:
Linux sillyname 2.6.22-gentoo-r5 #2 SMP Tue Aug 28 23:46:12 UTC 2007
i686 Intel(R) Core(TM)2 CPU 6400 @ 2.13GHz GenuineIntel GNU/Linux
it compiled fine and passed all tests with one exception:
sage -t devel/sage/sage/interfaces/r.py
*
Dan Drake wrote:
> On Wed, 23 Apr 2008 at 01:25PM -0700, John H Palmieri wrote:
> This is exactly why die-hard Python people say "don't use backslashes to
> continue statements":
>
> http://docs.python.org/dev/howto/doanddont.html#using-backslash-to-continue-statements
>
> Perhaps we should link
Built fine on
Linux sillyname 2.6.22-gentoo-r5 #2 SMP Tue Aug 28 23:46:12 UTC 2007
i686 Intel(R) Core(TM)2 CPU 6400 @ 2.13GHz GenuineIntel GNU/Linux
Doing 'make test', got stuck at dsage/tests/testdoc.py so I had to kill
it. I've put the build log at
http://bayes.colby.edu/~ghitza/inst
Built and tested on three machines running Gentoo. One of them passed
without any glitches, but the other two got stuck at testdoc.py (the
same way as in 3.0.1).
Best,
Alex
mabshoff wrote:
> Hello folks,
>
> this is Sage 3.0.2.alpha0. What happened? It seems that people
> were busy and unt
mabshoff wrote:
> On May 12, 9:45 pm, Alex Ghitza <[EMAIL PROTECTED]> wrote:
>
> Hi Alex,
>
>> Built and tested on three machines running Gentoo. One of them passed
>> without any glitches, but the other two got stuck at testdoc.py (the
>> same way
Built and tested on three x86 machines running Gentoo. All three had
the exact same failures as the ones David reported earlier:
sage -t devel/sage/sage/server/simple/twist.py
sage -t devel/sage/sage/server/support.py
Best,
Alex
mabshoff wrote:
> Hello folks,
>
> the 3.0
John Cremona wrote:
> On another point, how exactly did you merge a whole sequence of
> patches into one? I tried that using a very error-prone manual way
> (create newclone, copy all files which I know have changed under the
> patch sequence from oldclone to newclone, then commit). I'm sure you
Hi John,
I am about to put up a patch at #4064 (I'm adding a couple more doctests). It
is not perfect (it does not have proper doctests for 64 bit machines since I
don't have access to one), but I hope we can make it work soon.
Basically, I spent two days reading the libs/pari code and despairi
e build and test and report any issues.
>> Hopefully we will fix the ghmm/hmm Itanium issue tomorrow and move the
>> last step toward 3.1.2.final - the release is overdue. I also noticed
>> an odd failure in
>>
>> matrix/matrix_real_double_dense.pyx
>>
>> on
For the record, replacing polybori-05rc.p3.spkg with the new p4 version and
continuing the build process worked for me (dell laptop running ubuntu).
Alex
Georg S. Weber wrote:
> sorry,
> but the "polybori-05rc.p4.spkg" you pointed to (http://
> sage.math.washington.edu/home/mabshoff/release-cy
Builds fine on 32-bit ubuntu. As with rc2, there's trouble in sage0.py, and a
few related problems in randstate.pyx; I added a comment about this at trac
#4116.
Best,
Alex
mabshoff wrote:
> Hello folks,
>
> we are getting very close now. We fixed a bunch of blocker doctest
> issues and also
Hi,
It built fine on 3 machines:
- 32-bit dell laptop running ubuntu
- 64-bit 4-processor (AMD) running redhat of some sort
- 32-bit mac os x laptop
Testing was also successful on the first two machines, and ongoing on the third
(I'll report if anything goes amiss).
There's one weird thing: ma
Hi,
3 minutes is unbelievably short. However, since you asked for suggestions, here
are some things that would be good to get across:
- programming in Sage is programming in Python; no need to learn some arcane
custom-built language in order to use Sage and contribute to it
- the development mo
Hi folks,
John Cremona and I have been working for the past two weeks on fixing the
way real precision gets passed from Sage to the Pari library and back.
Things were extremely broken, due mostly to a misunderstanding of how the
Pari library (as opposed to GP sessions) deals with precision for ine
e tell me, to
> combine efforts (not blindly just double them), thanks!
>
>
--
Alex Ghitza -- Lecturer in Mathematics -- University of Melbourne --
Australia
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from
Yes.
On Tue, Sep 30, 2008 at 9:16 AM, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
> VOTE:
> [ ] Yes, include these in Sage
> [ ] No, do not (please explain)
> [ ] Hmm, I have questions (please ask).
>
>
--
Alex Ghitza -- Lecturer in Mathematics -- Universit
fr.
>
> Of course, any development help with mpc itself is also highly
> welcome! The only catch is that like mpfr, we follow the semantics
> that the result should be as exact as possible (the input is assumed
> to be an exact rational number, the output is rounded according to
&g
les-3.1.3/
>
> Please test and report issues as usual.
>
> Cheers,
>
> Michael
>
> #686: Martin Albrecht: write MPolynomial_libsingular over number
> fields [Reviewed by Alex Ghitza]
> #767: John Palmieri: animate has cryptic error message when
> imagemagick is not installed [
me up while writing a fix for
trac #4218.
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne --
Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.c
iscard this as wrong. Also, it's not just an issue
with symbolic variables:
sage: R = QQ['x']
sage: S = QQ['t']
sage: S(x)
t
I don't know what to do. If we want to keep the last two behaviors, it
seems that we're stuck with the first one as well.
Best,
eers,
> Martin
>
> --
> name: Martin Albrecht
> _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
> _www:
> http://www.informatik.uni-bremen.de/~malb<http://www.informatik.uni-bremen.de/%7Emalb>
> _jab: [EMAIL PROTECTED]
>
>
> >
both cases. For that matter, I'm not quite sure why
1/RR(0) is +infinity rather than -infinity, so I guess I would prefer for
*that* to be UnsignedInfinity as well.
On the other hand, I don't really use this sort of thing every day, so maybe
someone who's closer to this issue can chime
chael Abshoff: sage -bdist fails on osx 10.5 ppc and intel
> with libpng errors [Reviewed by Mike Hansen]
> #4214: Alex Ghitza: elliptic_logarithm gives inaccurate answers
> [Reviewed by Georg Weber]
> #4219: Michael Abshoff: MacOSX: work around java detection hang in r
> due to &q
seconds,
> butt it takes a few minutes using S:
>
> I am not really awake, but if I find more I will let you know.
>
> > -- William
>
> This talk (and the other two?) should obviously be stuffed (together
> with John's talk from SD 10) into some manual.
>
> Cheers,
>
&
> for the talk I'm
> giving tomorrow. The sage notebook and a normal article (or new section
> for the Sage documentation that will be in ReST) or the real format in
> which
> this talk will live longterm...
>
> -- William
>
> --
> William Stein
> Associate
#4297: Robert Bradshaw: make sage -cython work on .spyx and library
> files [Reviewed by Robert Miller]
> #4304: Martin Albrecht: split up NTL's decl.pxi [Reviewed by Robert
> Bradshaw, Michael Abshoff]
> #4311: Anne Schilling: added documentation for tensor prod
pport).
The following tests failed:
sage -t devel/sage/sage/tests/book_stein_ent.py
Total time for all tests: 2701.7 seconds
This is the same issue as the one reported previously in this thread.
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne --
Aust
Hi,
This seems to be a machine- or OS-dependent problem. On my Dell laptop
running Gentoo, the .eps file is created ok and I can view it with
display (ImageMagick) and evince, and make it into pdf using ps2pdf.
From your error message, it appears to be font-related. Do you have
the same pr
Hi,
I've run into a couple of problems while installing sage-2.7.3:
1. first I tried to install it from scratch; it choked on
lapack-20070723, and here's the end of install.log:
Host system
uname -a:
Linux latitude 2.6.21-gentoo-r4 #1 SMP Wed
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Great stuff.
page 3: I understand that you're quoting someone else, nevertheless it's
"Moldova", not "Moldava"
page 9: the citation source for Okounkov's quote is missing (shows as [?])
page 11: maybe change the line
"Commutative algebra: Singular"
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
About 30 seconds of google-ing "gpl commercial" yielded the following
email written by Richard Stallman (see below). Of course, it is
*theoretically* possible that he is also "confused about the GPL", but I
think that's unlikely. Of course, I a
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Installed successfully on Dell Latitude D620 (Core Duo T2400 1.83GHz)
running Gentoo and sage-2.8. It's slow because the laptop was running
on battery, and hence throttled down.
real29m12.096s
user26m1.034s
sys 1m22.641s
Successfully ins
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
I've looked at ticket #59, in which David Kohel says:
William, my student noticed some slow performance with elliptic curves
group law. I think there was a huge overhead in duplication:
sage: E = EllipticCurve([GF(101)(1),3])
sage: P =
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
I just noticed that this ticket was closed as fixed. To quote trac:
- -
I guess this has been fixed. With Sage 2.8.2 I get:
sage: E = EllipticCurve([GF(101)(1),3])
sage: P = E([-1,1,1])
sage:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
rc2 builds on
Machine: Linux sillyname 2.6.22-gentoo-r5 #2 SMP Tue Aug 28 23:46:12 UTC
2007 i686 Intel(R) Core(TM)2 CPU 6400 @ 2.13GHz GenuineIntel GNU/Linux
real53m35.322s
user48m47.946s
sys 4m20.216s
There are some issues in ma
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Sure enough, rc3 builds and all tests pass.
Alex
Alex Ghitza wrote:
> Hi,
>
> rc2 builds on
>
> Machine: Linux sillyname 2.6.22-gentoo-r5 #2 SMP Tue Aug 28 23:46:12 UTC
> 2007 i686 Intel(R) Core(TM)2 CPU 6400 @ 2.13GHz Genu
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Builds fine on
Machine: Linux latitude 2.6.21-gentoo-r4 #1 SMP Wed Jul 18 15:19:23 EDT
2007 i686 Genuine Intel(R) CPU T2400 @ 1.83GHz GenuineIntel GNU/Linux
There was one test failure:
**
org/sage_trac/ticket/262
>
> again. Here Graeme Taylor proposes his implementation of point counting of
> elliptic curves over GF(p^n) with coefficients in GF(p) in Weierstrass form.
>
> He describes the background at:
>
> http://maths.straylight.co.uk/archives/69
>
our __cmp__ methods are not getting called, verify that the
# canonical_coercion(x,y) is not throwing errors.
The last part seems to be what's happening. But what does that mean,
and how can I fix it?
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Mel
Spectrum of Integer Ring
Defn: Identity map
Call morphism:
From: Set of points of Spectrum of Integer Ring defined over Integer Ring
To: Set of points of Spectrum of Integer Ring defined over Integer Ring
}}}
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-
(X.identity_morphism())
}}}
Note the absence of output from the last command -- that's the None
that's creating all the trouble. OK, I think I can fix this now.
Robert and William, thanks for the help!
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of
;
>>>> Shouldn't this return True?
>>
>> Yes
>>
>>>> Shouldn't a test like this be somewhere
>>>> in rings/morphism.pyx?
>>
>> Yes.
>>
>
> This is now http://trac.sagemath.org/sage_trac/ticket/5820
>
And
ses
> elliptic_curves/ell_point.py to fail. So the bug might have been
> around for a while.
>
> John
>
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-- Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~-~--~~~---~--~---
A bit more info: on sage.math, it is working fine in sage-2.0, but
not in sage-2.10 (or anything later). I realise that quite a bit
happened between 2.0 and 2.10, but that's the only 2.*'s that I can
run (2.5 and 2.6 complain bitterly when started).
Weird.
--
Alex Ghitza -- L
this :)
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-- Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send
check whether the problem is in GF2X_coeff or
in GF2_conv_to_long, let alone how to fix this. Hopefully someone
else can figure it out.
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-- Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~
n to a seminar or I would make the patch...
>
Good stuff. Now I can go back to schemes :).
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-- Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~-~--~~~---~--~~
To post to thi
views:
- #5479 is 10 lines of code and a bunch of doctests. it has to do
viewing a prime ideal of R as a point of the scheme Spec(R)
- #5820 is really trivial: 3 lines of code and some doctests. it adds
a missing method for comparison of coercion ring morphisms.
Alex
--
Alex Ghitza
On a couple of 32-bit machines running archlinux, upgraded and built
fine from 3.4.2.alpha0, and everything under "make ptestlong" passes.
Best,
Alex
On Thu, Apr 30, 2009 at 10:23 PM, mabshoff wrote:
>
> Hello folks,
>
> here goes 3.4.2.rc0 - a little later than planned, but it seems like
> we
**
> 1 items had failures:
> 1 of 9 in __main__.example_18
> ***Test Failed*** 1 failures.
> For whitespace errors, see the file /home/mabshoff/build-3.4.2.rc0/
> sage-3.4.2.rc0-ciero-gcc-4.3.3/tmp/.doctest_matrix_symbolic_dense.py
> [113.0 s]
>
> * Please see http://www.sagemath.org//packages for a list of valid
> * packages or check the package name.
> ******
>
> I could not find sage-mode on http://www.sagemath.org/packages/
>
--
the
right one. You can maybe guess from the timings why I didn't try
prime_pi(2^51). I have, however, tried smaller values. I'm going to
put that data up on the trac ticket.
I have absolutely no idea what's wrong, but something definitely is,
and hopefully this will help someone fix i
[46, 2280998753949],
[47, 4454203917918]]
And as mentioned before, the values up to 46 are correct, and the
value at 47 is wrong.
> PS, Mathematica computes PrimePi[some_negative_number] as 0. Does Sage
> handle that case ok?
>
sage: prime_pi(-20
Sage Packages" at
> http://modular.math.washington.edu/sage/doc/developer/producing_spkgs.html
>
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-- Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~-~--~~~---~--~~
To po
I can't work out right now what time it will be in Melbourne during
these talks, but if it's not during my teaching/seminars/office hours
then I would happily watch a live video stream.
(So I guess my answer is pretty much isomorphic to Jason Grout's.)
Best,
Alex
--
Alex Ghitza
by Jaap Spies]
> #5983: Michael Abshoff: cmp related doctest failure in sage/schemes/
> jacobians/abstract_jacobian.py [Reviewed by William Stein]
> #5984: Michael Abshoff: cmp related doctest failure in sage/modular/
> arithgroup/arithgroup_perm.py [Reviewed by William Stein]
> #599
quot;NotImplemented" or "False"? I'm not sure.)
>
I'm strongly in favour of NotImplementedError, since False would
possibly quietly return a mathematically wrong answer.
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University o
vertical asympotes [Reviewed by
> Marshall Hampton]
> #6036: Kwankyu Lee: a bug in polynomial() for PolynomialRing(GF(5),2)
> [Reviewed by Mike Hansen]
> #6037: Jon Hanke: Major Upgrade to QuadraticForm Local Density
> Routines [Reviewed by Gonzalo Tornaria]
> #6040: Jon Hanke: Ad
are some memory leaks in ratpoints, but we will work on fixing
> these next week at Dagstuhl.
>
> Statistics:
> spkg size: 255K
> time to build: 5.6 secs
>
> What does everyone think?
+1, and thanks for your work on this!
Alex
--
Alex Ghitza -- Lec
on't draw vertical asympotes [Reviewed by
> Marshall Hampton]
> #6036: Kwankyu Lee: a bug in polynomial() for PolynomialRing(GF(5),2)
> [Reviewed by Mike Hansen]
> #6037: Jon Hanke: Major Upgrade to QuadraticForm Local Density
> Routines [Reviewed by Gonzalo Tornaria]
> #6040:
to also include long doctests.
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-- Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To uns
;t know enough about trac to see if it can be
done, but maybe this can spur some activity in this direction.
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics -- The University of Melbourne
-- Australia -- http://www.ms.unimelb.edu.au/~aghitza/
--~--~-~--~~~
a
Linux artin 2.6.29-ARCH #1 SMP PREEMPT Wed May 20 07:06:02 UTC 2009
i686 Intel(R) Core(TM)2 Duo CPU T9300 @ 2.50GHz GenuineIntel GNU/Linux
I will try to downgrade my gcc and rebuild sage, and I'll report what happens.
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics --
On Sat, May 30, 2009 at 11:17 AM, Mike Hansen wrote:
>
> On Fri, May 29, 2009 at 5:00 PM, Alex Ghitza wrote:
>> Hi,
>>
>> On my dell laptop running archlinux, my build from scratch fails at
>> eclib. I've extracted the relevant part from install
I have tried this in 3.4.1, 3.4.2, and 4.0.rc2, without success:
plot3d(lambda x,y: exp(x+y*I).real(), (-2, 2.4), (-3, 3), mesh=True)
I get a nice looking surface (see attached jpeg file), but no mesh
lines. Is anybody else experiencing this?
Best,
Alex
--
Alex Ghitza -- Lecturer in
.roots(R)
>
> How do I convert or coerce poly to be in R?
>
Here is one option:
def myroots(p):
R = IntegerModRing(p)
RR. = R[]
f = poly(x=t)
return f.roots(R)
Best,
Alex
--
Alex Ghitza -- Lecturer in Mathematics --
give more details (which version
of Sage are you using, are you working in the command line or the
notebook).
Best,
Alex
On Sun, May 31, 2009 at 4:21 PM, wkehowski wrote:
>
> Thanks, but here is the error message:
>
> TypeError: polynomial must be over a field of characteristic
1 - 100 of 331 matches
Mail list logo
