On Nov 6, 7:49 pm, Jonathan Gutow wrote:
>
> 2) Development of a plot4d command allowing time dependent 3-D plots. I
> believe this requires a little work on Jmol, but mostly a reworking of how
> sage sends data to Jmol.
That sounds very nice! Something I would love to see is genuine real
ti
On 11/6/10 10:19 PM, Volker Braun wrote:
I also noted that the z-ordering of polygons done by jmol has issues
close to where triangles meet.
Being able to generate 2d vector graphics for 3d graphics objects
would be nice.
Is there a roadmap for the future of 3d graphics on Sage? Having
somethin
On Nov 6, 5:06 pm, "Dr. David Kirkby" wrote:
> On 11/ 6/10 10:25 PM, William Stein wrote:
>
> > I think it would be wonderful to have a fast implementation of
> > computing the number primes up to x, which is freely available,
> > especially given the central role that the Riemann Hypothesis (wh
On Sat, Nov 6, 2010 at 12:20 PM, Martin Albrecht
wrote:
> Hi,
>
> turns out in order to use the cool new Cython 0.13 C++ features
>
> http://docs.cython.org/src/userguide/wrapping_CPlusPlus.html
>
> one has to patch Sage's setup.py slightly, see:
>
> http://trac.sagemath.org/sage_trac/ticket
On Sat, Nov 6, 2010 at 6:49 PM, Jonathan Gutow wrote:
> Dear Sage user and developers,
>
>>
> In addition to being sure that I work on something the community is
> interested in, I also need a commitment from one or two people who are very
> familiar with the notebook code to be available for co
I also noted that the z-ordering of polygons done by jmol has issues
close to where triangles meet.
Being able to generate 2d vector graphics for 3d graphics objects
would be nice.
Is there a roadmap for the future of 3d graphics on Sage? Having
something hardware accelerated would be nice with t
It would be good if someone who knows some Cython could now review the
Parma Polyhedra Library (PPL) spkg and Cython interface at
http://trac.sagemath.org/sage_trac/ticket/10039
The interface is essentially a straight-forward wrapper of the PPL C++
library, with a few workarounds for private cons
On 11/6/10 8:49 PM, Jonathan Gutow wrote:
1) Development of a slicer within Jmol. This would allow hiding all
but an arbitrary thickness and orientation slice of the 3-D image.
This involves both Jmol developments and probably additions to the
javascript interface for the notebook. This I beli
On 11/6/10 8:37 PM, William Stein wrote:
On Sat, Nov 6, 2010 at 5:06 PM, Dr. David Kirkby
wrote:
On 11/ 6/10 10:25 PM, William Stein wrote:
I think it would be wonderful to have a fast implementation of
computing the number primes up to x, which is freely available,
especially given the cent
Dear Sage user and developers,
First I apologize if you see multiples of this message, but I wanted to reach
as much of the community as possible so posted to sage-devel, -edu and
-notebook. If there is anywhere else this should be cross listed please let me
know.
I'm looking for input on wha
On Sat, Nov 6, 2010 at 5:06 PM, Dr. David Kirkby
wrote:
> On 11/ 6/10 10:25 PM, William Stein wrote:
>
>> I think it would be wonderful to have a fast implementation of
>> computing the number primes up to x, which is freely available,
>> especially given the central role that the Riemann Hypothes
Hi Mitesh,
On Sun, Nov 7, 2010 at 8:17 AM, Mitesh Patel wrote:
> How serious are these errors?
To me, the errors reported by "hg verify" is not serious. That's
because it's trivial to recover from the error at the cost of possibly
generating new hashes. Here's how to recover the whole Sage
4.6.1
On 11/ 6/10 10:25 PM, William Stein wrote:
I think it would be wonderful to have a fast implementation of
computing the number primes up to x, which is freely available,
especially given the central role that the Riemann Hypothesis (which
is a statement about pi(x)) has in mathematics. It's sad
On Sat, Nov 6, 2010 at 11:05 AM, David Kirkby wrote:
> On 6 November 2010 10:37, Bill Hart wrote:
>> David, do you mean compute prime_pi up to some huge bound (by doing
>> sieving in parallel), then make a giant table with "waypoints" which
>> Sage refers to.
>
> The magic code apepars to be the
Running 'hg verify' in 4.6.1.alpha0's sage repository, I see
$ cd SAGE_ROOT/devel/sage
$ hg verify
checking changesets
checking manifests
crosschecking files in changesets and manifests
checking files
data/.gitignor...@10122: missing revlog!
data/.hgignor...@0: missing revlog!
[...]
data/spkg-i
Anyone using Mathematica would have the online documentation 'help'
system.
So far as I can tell, each command that uses an algorithm (partially)
documented
on that page has a link from the command documentation to that page.
A regular user of Mathematica with some curiosity about algorithms
will
h
Hi,
turns out in order to use the cool new Cython 0.13 C++ features
http://docs.cython.org/src/userguide/wrapping_CPlusPlus.html
one has to patch Sage's setup.py slightly, see:
http://trac.sagemath.org/sage_trac/ticket/10230
Robert, can you take a look and review it? It would be great
Why not look around at the state of the art
in using computers to do something that might be of some benefit.
Math doesn't have to be useless.
You can look at what other people, especially computer scientists,
have been trying to do and how they are approaching parallelism.
Here's a place you can
On 6 November 2010 10:37, Bill Hart wrote:
> David, do you mean compute prime_pi up to some huge bound (by doing
> sieving in parallel), then make a giant table with "waypoints" which
> Sage refers to.
The magic code apepars to be the
"Meissel-Lehmer-Lagarias-Miller-Odlyzko algorithm"
, which I t
Having talked to Nathan briefly, I think that he may be interested in
potentially improving already existing algorithms. This is a bit
beyond my scope of knowledge, so I suggested that he contact this
list.
On Nov 5, 2:48 pm, nekopczynski wrote:
> Hello Everyone,
> I am currently a senior comput
Hi all,
First I want that thank everybody who helped us improve the
translation.
Right now I'm confident that the quality of the translation is high
enough for it to be included into the sage distribution.
So i created the patch, but I still need some German speaking sage
developer to review it.
Mistakes by authors and/or referees and/or editors are fairly
commonplace. Requiring the author to supply all software in
source code (e.g. all of Sage version XYZ) and requiring referees
to look at it for possible errors, and requiring editors/publishers
to make the source code available (archiva
So far that is working, i.e. Atlas has completed and no other packages
seem to have tripped over any side effects.
Thanks again.
On Nov 5, 7:24 pm, Volker Braun wrote:
> You can try my new atlas spkg
> athttp://trac.sagemath.org/sage_trac/ticket/10226
> if you have a minute.
>
> SAGE_ATLAS_ARCH
I get confused with the directions about running in virtual box (-:
I think it should be OK and very possible to create virtual
machines, say within virtual box within Windows Vista and install
Linux in those VMs , then go ahead and install Sage on the Linux.
i.e. (Windows Vista (Virtual Box(UBUNT
Hi,
could someone please look at http://trac.sagemath.org/sage_trac/ticket/9747?
This bug has been around for a while and is really annoying. Also fix is
rather short. (Basically -9 lines.)
Thanks,
Philipp
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe fro
I would like to try that.
I will report back results (good or bad).
Is there any info you would like me to collect from good/bad results ?
Thanks.
On Nov 5, 7:24 pm, Volker Braun wrote:
> You can try my new atlas spkg
> athttp://trac.sagemath.org/sage_trac/ticket/10226
> if you have a minute.
>
Hi Minh,
Thanks for the quick reply! I tried applying the patch but
nothing changed (I hope I applied it correctly...).
I will try unpacking and building 4.6 from scratch again, maybe
something went wrong last time. If no one else is having this
problem it is maybe something wrong in my setup.
T
> I'm not a guru, but is it defined in
>
> SAGE_ROOT/devel/sage/c_lib/include/ccobject.h
>
> ? Both ntl_wrap.h and pb_wrap.h include this file.
Doh, how could I miss that. Thanks!
> > If heap-allocated instances are fast enough, you can use the much
> >
> > easier C++ support (recently merge
Hi Håkan,
On Sat, Nov 6, 2010 at 9:54 PM, Håkan Granath
wrote:
> When I try to build the Sage 4.6 pdf reference manual by running
>
> ./sage -docbuild reference pdf
>
> it fails with no pdf output. This happens on 64 bit Ubuntu
> 10.04.1 LTS. It works fine to build the Sage 4.5.3 reference
> manu
When I try to build the Sage 4.6 pdf reference manual by running
./sage -docbuild reference pdf
it fails with no pdf output. This happens on 64 bit Ubuntu
10.04.1 LTS. It works fine to build the Sage 4.5.3 reference
manual on the same machine.
The end of reference.log is below.
Regards,
Håkan
David, do you mean compute prime_pi up to some huge bound (by doing
sieving in parallel), then make a giant table with "waypoints" which
Sage refers to.
If that's what you are referring to, then yeah I guess you could get a
project out of that if it hasn't already been done. If you were a
strong p
On 6 November 2010 06:43, Mitesh Patel wrote:
> On 11/05/2010 07:25 PM, Jason Grout wrote:
>> On 11/5/10 5:16 PM, Mitesh Patel wrote:
>>> On 11/05/2010 07:49 AM, kcrisman wrote:
> http://sage.math.washington.edu/home/buildbot/binaries/
>
> Does it usually take a long time (~1 hour
32 matches
Mail list logo
