Hi everyone,
a reminder that you still have until 15th of September to submit a talk for
PyCon 2015 in Montreal. I read some of you are attending SciPyEurope or
EuroPython and that's great!
A talk proposal is much shorter than a conference paper, mine took only one
day to write. If you don't
Just a short note,
On Mon, 25 Aug 2014, Travis Scrimshaw wrote:
Although I don't think we have methods to get all lattices of a given
rank yet in Sage...IDK off-hand for sure.
Yep, AFAIK there is none.
Nathan Lawless has made a code for generating lattices (and has given it
to me).
Did you cd into the sage directory? How did you download Sage?
On Mon, Aug 25, 2014 at 10:04 PM, john_perry_usm john.pe...@usm.edu wrote:
Hello
I'm trying to review a bug. I haven't worked with git before, so I tried
following the Sage Development Guide. I'm getting stuck on the step where
Hi everyone,
a reminder that you still have until 15th of September to submit a talk for
PyCon 2015 in Montreal. I read some of you are attending SciPyEurope or
EuroPython and that's great!
A talk proposal is much shorter than a conference paper, mine took only one
day to write. If you don't
There is a list of bugs marked with the beginner keyword, these should be
a good starting point if you want to familiarize yourself with the code:
http://trac.sagemath.org/report/38 (linked
from http://trac.sagemath.org/wiki/TicketReports)
On Tuesday, August 26, 2014 1:48:03 AM UTC+1,
-- Forwarded message --
From: Victor Shoup sh...@cs.nyu.edu
Date: 22 August 2014 04:19
Subject: NTL version 6.2
To: nmbrt...@listserv.nodak.edu
I'd like to announce a new release of NTL, a high-performance C++ library
for doing arithmetic in a variety of fundamental rings.
Sounds like a reasonable plan if you (or someone) can be bothered to
sort out the chenges which will need to be made in code and doctests!
There will be places where we now have: for p in primes(10^8):
do_something_with(p) which will still work when primes() returns a
list, so will not result in
On Tue, Aug 26, 2014 at 3:00 PM, Vincent Delecroix
20100.delecr...@gmail.com wrote:
Hello,
Right now, we have the following functions
- primes: an iterator over primes
- prime_range: a list of primes (in Cython)
- prime_powers: a list of prime powers
- prime_power_range: another
And you can of course define the layout yourself using the get_pos/set_pos
methods.
And you can save the embedding with g.show(save_pos=True).
And you can use those two nice functions to define a cool embedding
yourself if you like:
sage: from sage.graphs.graph_plot import _circle_embedding
On Tue, Aug 26, 2014 at 3:12 PM, John Cremona john.crem...@gmail.com wrote:
Sounds like a reasonable plan if you (or someone) can be bothered to
sort out the chenges which will need to be made in code and doctests!
Even then, personally I don't like it. See below for a different
suggestion
Can you be a bit more specific about the area you want to contribute? Core
system, Notebook HTML interface, an underlying library, mobile devices
(android, iOS) or even some new high-level functionality?
Don't we do maths in Sage, too ? :-P
Nathann
--
You received this message because
Hi,
2014-08-26 15:18 UTC+02:00, William A Stein wst...@uw.edu:
On Tue, Aug 26, 2014 at 3:00 PM, Vincent Delecroix
20100.delecr...@gmail.com wrote:
Hello,
Right now, we have the following functions
- primes: an iterator over primes
- prime_range: a list of primes (in Cython)
-
Yo !
I do not have anything specific in mind.
It's not a problem. We all write Sage code because Sage can't do what we
need. Here are the steps you should follow:
1) Use it
2) Figure out that your code fails because there is a bug in Sage OR Wonder
why the feature you need is not implemented
Hi,
Le 26/08/2014 14:11, John Cremona a écrit :
-- Forwarded message --
From: Victor Shoup sh...@cs.nyu.edu
Date: 22 August 2014 04:19
Subject: NTL version 6.2
To: nmbrt...@listserv.nodak.edu
I'd like to announce a new release of NTL, a high-performance C++ library
for doing
2014-08-26 15:22 UTC+02:00, William A Stein wst...@uw.edu:
On Tue, Aug 26, 2014 at 3:12 PM, John Cremona john.crem...@gmail.com
wrote:
Sounds like a reasonable plan if you (or someone) can be bothered to
sort out the chenges which will need to be made in code and doctests!
Even then,
On 26 August 2014 14:33, Julien Puydt julien.pu...@laposte.net wrote:
Hi,
Le 26/08/2014 14:11, John Cremona a écrit :
-- Forwarded message --
From: Victor Shoup sh...@cs.nyu.edu
Date: 22 August 2014 04:19
Subject: NTL version 6.2
To: nmbrt...@listserv.nodak.edu
I'd like
On 26 August 2014 14:49, Vincent Delecroix 20100.delecr...@gmail.com wrote:
2014-08-26 15:22 UTC+02:00, William A Stein wst...@uw.edu:
On Tue, Aug 26, 2014 at 3:12 PM, John Cremona john.crem...@gmail.com
wrote:
Sounds like a reasonable plan if you (or someone) can be bothered to
sort out the
On Tuesday, August 26, 2014 3:34:04 PM UTC+2, Snark wrote:
Hi,
Le 26/08/2014 14:11, John Cremona a écrit :
-- Forwarded message --
From: Victor Shoup sh...@cs.nyu.edu javascript:
Date: 22 August 2014 04:19
Subject: NTL version 6.2
To:
On 26 August 2014 14:52, John Cremona john.crem...@gmail.com wrote:
On 26 August 2014 14:33, Julien Puydt julien.pu...@laposte.net wrote:
Hi,
Le 26/08/2014 14:11, John Cremona a écrit :
-- Forwarded message --
From: Victor Shoup sh...@cs.nyu.edu
Date: 22 August 2014 04:19
On Tuesday, August 26, 2014 3:53:00 PM UTC+2, John Cremona wrote:
On 26 August 2014 14:33, Julien Puydt julien...@laposte.net javascript:
wrote:
Hi,
Le 26/08/2014 14:11, John Cremona a écrit :
-- Forwarded message --
From: Victor Shoup sh...@cs.nyu.edu
On Tue, Aug 26, 2014 at 3:34 PM, Nathann Cohen nathann.co...@gmail.com wrote:
Yo !
I do not have anything specific in mind.
It's not a problem. We all write Sage code because Sage can't do what we
need. Here are the steps you should follow:
1) Use it
2) Figure out that your code fails
On Tuesday, August 26, 2014 2:49:13 PM UTC+1, vdelecroix wrote:
But I really will not use it myself because it has a classcall,
UniqueRepresentation, category, etc which takes lifetime to
initialize. My loops are rather small but I have plenty of them..
Actual or imagined overhead cost? As
Hi,
Le 26/08/2014 16:14, Jean-Pierre Flori a écrit :
On Tuesday, August 26, 2014 3:34:04 PM UTC+2, Snark wrote:
Hi,
Le 26/08/2014 14:11, John Cremona a écrit :
-- Forwarded message --
From: Victor Shoup sh...@cs.nyu.edu javascript:
Date: 22 August 2014 04:19
Subject: NTL
On 26 August 2014 16:21, Julien Puydt julien.pu...@laposte.net wrote:
Hi,
Le 26/08/2014 16:14, Jean-Pierre Flori a écrit :
On Tuesday, August 26, 2014 3:34:04 PM UTC+2, Snark wrote:
Hi,
Le 26/08/2014 14:11, John Cremona a écrit :
-- Forwarded message --
From: Victor
Does this have anything to do with sage? These are merely git trac
commands. Nothing in those instructions tells me to change to the sage
directory, or even to download Sage, though I did in fact download Sage
previously using the instructions
here:
On Tuesday, August 26, 2014 4:54:55 AM UTC-5, Harald Schilly wrote:
You need to be in a directory, where there is a .git in it or in any of
its parents. Preferably, It should be the sage directory ;-)
OK, I thought I had followed the instruction, first go to the Sage
directory, but
Jori, Volker,
There are ACLs set up here, which I cannot control, so I will work on it on
my own machine when I can.
Based on the little I have been able to try so far, maybe the error
messages themselves, or a failing return code, (from cp) is the cause.
'Many Thanks for your help !
On Tue, 26 Aug 2014, Jori Mantysalo wrote:
Gunnar Brinkmann has made a code for generating posets. I think I'm
going to try if I can compile it as a part of Sage.
I got permission from Brinkmann and Brendan McKay to add code to Sage. The
code is written in C.
The code is much faster, about
Two remarks:
1. It makes no sense for this post to go to the sage-release mailing
list. It should go to sage-flame (or maybe sage-devel). It
Here is a sage-devel reason.
2. I can cite several reasons for the SAGE has failed and all the
reasons can still be corrected:
But please don't change the mission statement! Your own personal one can
still be the research piece, that is cool. But I think Sage has
experienced
a lot of the success it has precisely because you didn't see a problem
with
sharing with a broader vision than just the research community.
Hell !!!
I got permission from Brinkmann and Brendan McKay to add code to Sage. The
code is written in C.
HMmmm... Permission ?.. Which kind ?
The problem we met with Bendan McKay's Nauty is that the license is not
GPL-compatible (because he does not want his software to be used
Hi Jori,
On 2014-08-26, Jori Mantysalo jori.mantys...@uta.fi wrote:
The code is much faster, about one second compared to one day with current
Sage.
However, Sage does not give a list of posets, but an iterator over them;
hence memory requirements are almost none for code that searches for
Hello,
a doctest fails on an system I'm interested in (I want to run patchbot on that
system)
File src/sage/structure/sage_object.pyx, line 1411, in
sage.structure.sage_object.unpickle_allFailed example:
sage.structure.sage_object.unpickle_all() # (4s on sage.math, 2011)
On Tue, Aug 26, 2014 at 8:51 PM, kcrisman kcris...@gmail.com wrote:
Two remarks:
1. It makes no sense for this post to go to the sage-release mailing
list. It should go to sage-flame (or maybe sage-devel). It
Here is a sage-devel reason.
OK, thread moved to sage-devel.
2. I can cite
Which tar is that? What kind of system are we talking about? Seems like
you need to at least install Gnu tar.
On Tuesday, August 26, 2014 9:06:13 PM UTC+1, Jakob Kroeker wrote:
Hello,
a doctest fails on an system I'm interested in (I want to run patchbot on
that system)
File
I hope no one minds my resurrecting this, but after having spent a lot of
time waiting for Sage to rebuild itself 3 or 4 times, I just discovered
this hint, and would like to suggest it make its way
onto http://www.sagemath.org/doc/developer/trac.html#section-review-patches,
and all other
What's your tar version? (ie what does answer the command tar
--version). Looks like you have a very strange one.
And, by the way, what is the system you are interested in? Might be
useful to know for debugging...
Vincent
2014-08-26 22:06 UTC+02:00, Jakob Kroeker kroe...@uni-math.gwdg.de:
Hello,
Working on #16681, it appears that there is a problem with
factorization of polynomials over finite fields... (despite the ticket
name, the bug has nothing to do with the recently implemented
algebraic closure of finite fields).
* if you want to help (i.e. run the tests on your computer)
OS:
openSUSE 12.3 (x86_64)
VERSION = 12.3
CODENAME = Dartmouth
tar --version
tar (GNU tar) 1.26
Am Dienstag, 26. August 2014 23:11:43 UTC+2 schrieb vdelecroix:
What's your tar version? (ie what does answer the command tar
--version). Looks like you have a very strange one.
And, by the
I am again very interested in having Windows 64 ports of various packages.
At the top of my list are:
* GAP
* Singular
* Pari/GP
Note that MinGW2 is a much better way to do this than has previously been
available. It builds packages in a tiny fraction of the time it takes to
build with MinGW.
I forgot some for porting C:
* MSVC is a C++ compiler, so malloc must always be cast, e.g. ulong * a =
(ulong *) malloc(32*sizeof(ulong)); instead of ulong * a =
malloc(32*sizeof(ulong));
* Addition of C++ guards around headers
* Adding declspec(__dllexport__) in front of all prototypes in .h
We already have Primes (upper case P) for that... it just need to be
tuned to accept lower/upper bounds. It is nicer from the user point of
view (as far as OOP is better than functional programming). A good
solution for the namespace would be to have only Primes and
PrimePowers.
But
On Wed, Aug 27, 2014 at 5:01 AM, Travis Scrimshaw tsc...@ucdavis.edu wrote:
We already have Primes (upper case P) for that... it just need to be
tuned to accept lower/upper bounds. It is nicer from the user point of
view (as far as OOP is better than functional programming). A good
solution
43 matches
Mail list logo
