Re: [sage-devel] On (di)graph generation

On Tue, Oct 10, 2017 at 10:45 PM, Jori Mäntysalo wrote: > 4) When is augment='edges' usefull? Is > One reason it is useful: You can use the argument "property" to restrict to a subclass of graphs. This argument takes a function and filters the output by testing against

Re: [sage-devel] Nauty vs SageMath speed comparisons?

is the state of the art in graph >> isomorphism and canonical labeling of graphs. What I don't know (but maybe >> you do?) is how far SageMath is lagging behind. Did anyone do any testing on >> this? I saw a mention of a paper by Robert Miller, but the link was dead. >> >> I'd appr

[sage-devel] Hiring mathematical programmers!

Hi all, I am looking for mathematical programmers to join my team. I work at a startup in downtown San Francisco that focuses on distilling the enormous amounts of publicly available data (think patents, FDA trials, FBO grants, news, twitter, etc.) into intelligible insights and narratives. We

Re: [sage-devel] Re: bug in graph isomorphism in sage-4.7

Vincent, Thanks Robert for pointing this. But is the following the expected behavior ? Of course not, that is clearly wrong. I've tracked down the bug, and posted a patch at: http://trac.sagemath.org/sage_trac/ticket/11620 This should fix the problem. ... However, when running doctests I

Re: [sage-devel] Re: bug in graph isomorphism in sage-4.7

See http://trac.sagemath.org/sage_trac/ticket/10549 On Wed, Jul 13, 2011 at 11:01 AM, Maarten Derickx m.derickx.stud...@gmail.com wrote: Spending about an hour on debugging I got really close to the source of the problem. The main problem is that DiGraph (and probably Graph also but I did

Re: [sage-devel] Re: bug in graph isomorphism in sage-4.7

On Wed, Jul 13, 2011 at 11:47 PM, Robert Miller r...@rlmiller.org wrote: See http://trac.sagemath.org/sage_trac/ticket/10549 ... and its dependencies. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr

Re: [sage-devel] Patch rejected after merge

. In this case, the *author* of those tickets decided to change the already-merged #10804 as opposed to the not-yet-merged #10549.  I think listening to the author (Robert Miller) was the right thing to do here. I disagree with your logic-- you can't justify A with B if B happened after A... You backed

Re: [sage-devel] Patch rejected after merge

If a ticket's been merged, unless it's found to have a genuine flaw, it should supersede ... tickets ... which have not been merged. +1 -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send

Re: [sage-devel] Sage videos on Google video

http://news.slashdot.org/story/11/04/23/1220202/Google-Will-Save-Videos-After-All On Sat, Apr 23, 2011 at 9:51 PM, William Stein wst...@gmail.com wrote: However... the URL's have of course all changed.  They are videos mostly from various Sage Days, so it would be very beneficial if somebody

[sage-devel] buildbot applying to 4.6.2

I'm not sure exactly how the buildbot works, but it seems to be automatically testing new patches against sage-4.6.2, even though the latest (dev) sage is 4.7.alpha4. Isn't it a waste of (someone's) computing resources to be using such an outdated version? -- Robert L. Miller

Re: [sage-devel] Re: Automatically annotate when compiling Cython file

On Sat, Apr 16, 2011 at 5:13 PM, kcrisman kcris...@gmail.com wrote: %cython at the top of a notebook cell produces links to the C code and to the yellow-highlighted expandable/collapsible HTML file as side- effects.  It is a simple way to see how Cython works on code, or a great thing to use

[sage-combinat-devel] permutation groups

, GAP uses Monte Carlo algorithms, which actually means that the results are not provably correct, just very very probably so. I have not yet checked whether this has a bearing on whether Sage's proof=True option is incorrect somewhere, but it is possible. Tom wrote: Robert Miller has been hard

[sage-devel] permutation groups

, GAP uses Monte Carlo algorithms, which actually means that the results are not provably correct, just very very probably so. I have not yet checked whether this has a bearing on whether Sage's proof=True option is incorrect somewhere, but it is possible. Tom wrote: Robert Miller has been hard

Re: [sage-devel] error doing install_package('glpk')

On Wed, Apr 6, 2011 at 4:37 PM, VictorMiller victorsmil...@gmail.com wrote: cdef int build_glp_prob(c_glp_prob * lp, c_glp_iocp * iocp, LP, int log, bool names) except -1: ^

Re: [sage-devel] Re: Valgrind package very old

I also noticed that the valgrind package is old; In particular it doesn't even compile on Fedora 14. But then its such a commonly-used tool that its already on every machine that is used for software development. The fact that nobody every complained about the outdated valgrind spkg should

Re: [sage-devel] Looking for graph comparison operator

Dear Ryan, On Thu, Mar 17, 2011 at 8:34 PM, Ryan Hinton iob...@email.com wrote: Where are the comparison operators for graphs implemented?  I can find ``__eq__`` in graphs/generic_graph.py, but I can't find any others. There is also __ne__. Comparison was implemented in Sage for a while, but

Re: [sage-devel] Re: Failed tests for accuracy reasons

More OT: On Mon, Mar 14, 2011 at 12:42 PM, Willem Jan Palenstijn w...@usecode.org wrote: You can use 'hg blame' or similar to get the revision in which a line/doctest was changed, and then 'hg log -r revision' to get the commit message of that revision. And for a while now we've tried to

[sage-devel] exceptions, Python, Cython, C

I'm working on wrapping a C package in Cython for use in Sage, and I'm having some trouble. I think the problem has to do with the fact that the C program uses stderr to report issues. When the program exits, I get the following message: SystemError: error return without exception set I've

[sage-devel] Drew Sutherland's galrep: #8617

Hello all, A while ago we tried merging Drew Sutherland's galrep package[1], which uses random methods to find a subgroup of the image of Galois for mod-p representations coming from elliptic curves. There were a few problems with segfaults, and other issues, all of which are linked from [1].

Re: [sage-devel] Re: bug in QQ[x]

On Fri, Jan 28, 2011 at 4:54 PM, Nils Bruin nbr...@sfu.ca wrote: What answer would you prefer? 1404928 is a unit in QQ[]. Does the following do what you were expecting? Ah, of course. Apologies for the spam. -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an

[sage-devel] bug in QQ[x]

I don't have time to track this down at the moment, but as it is a bit embarrassing I thought I'd report it here for now: sage: R.d = QQ[] sage: E = EllipticCurve([0,0,0,-595*d^2,5586*d^3]) sage: E.discriminant().factor() (1404928) * d^6 sage: 2^12*7^3 1404928 -- Robert L. Miller

Re: [sage-devel] Re: Immutable digraphs

On Tue, Jan 25, 2011 at 6:06 AM, Nathann Cohen nathann.co...@gmail.com wrote: I just noticed that DiGraph produces graphs that are mutable. Is there any alternative implementation of digraphs (with multiple edges) in Sage that are immutable? Not to my knowledge Though you're not the first

Re: [sage-devel] untrusted user?

This file (hgrc) should be removed. It must have ended up there while I was release managing sage-4.1, although how it ended up there I have no idea. On Thu, Jan 20, 2011 at 11:13 AM, Emil Widmann emil.widm...@gmail.com wrote: I compiled 4.6.1 and did make ptestlong All tests passed but one:

[sage-combinat-devel] Re: .

On Dec 17, 6:38 pm, Anne Schilling a...@math.ucdavis.edu wrote: Thank you, very nice! However, playing around with this, also in the setting of crystals, I came across the following bug: ... Please see trac #10516. -- You received this message because you are subscribed to the Google Groups

[sage-combinat-devel] Re: .

Anne, The digraphs in sage also have isomorphism/automorphism groups implemented. The pointer William gave you is for undirected graphs, but if you go up a level you see much more generality... sage: D = digraphs.RandomDirectedGNP(10, .2) sage: E = digraphs.RandomDirectedGNP(10, .2) sage:

Re: [sage-devel] Strange behaviour of add_edges

The keyword is multiedges not multi_edges. Weird artifact of using NetworkX as the default implementation historically... On 7 December 2010 20:57, mhs schraud...@math.uni-heidelberg.de wrote: Hi, I encountered a strange behaviour of the add_edges method for DiGraphs (using SAGE 4.5.1).

Re: [sage-devel] graph theory: refactor implementation of spanning tree algorithms

I'm not sure it is a good idea to *remove* the methods from the object of which they are a natural function. I've seen this argument many times before, and I really like this as an organizing method. Everything else you say seems like a good idea to me: improving the documentation, having the

Re: [sage-devel] Re: graph theory: refactor implementation of spanning tree algorithms

Goodies like algorithms for randomized spanning tree constructions should go into another module like sage/graphs/trees.pyx. I feel this is really a time to declare a serious moratorium on adding new methods to any of the following modules, unless there is a good reason to do so: *

Re: [sage-devel] graph theory: inconsistent behaviour in G.allow_loops(False)

Here's what is going on: There are two arrays, in_degree and out_degree, which count the number of arcs coming in and going out, respectively. Then the degree of a vertex is the sum of these things if you don't worry about loops. If a graph is not directed, then the degrees are doubled, since

Re: [sage-devel] graph theory: inconsistent behaviour in G.allow_loops(False)

Minh, I've fixed the problem and I'll post a patch once I finish testing it... -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For

Re: [sage-devel] Re: Some feature requests on SAGE - Adding Engineering to the target audience

On Fri, Aug 6, 2010 at 4:52 PM, cousteau cousteaulecommand...@gmail.com wrote: The aim of my syntax suggestion wasn't to clone Matlab's syntax, but to provide an easy way to input matrices. Speaking of syntax and matrices, let's not forget the seemingly bizarre behavior one gets when one does

[sage-combinat-devel] Cayley graph connecting_set

Going through some graph theory stuff, I noticed that the documentation for cayley_graph mentions that the option connecting_set is deprecated, but it isn't really. Just thought I'd ping the combinat list about this... -- Robert L. Miller http://www.rlmiller.org/ -- You received this message

[sage-devel] Re: complementary problem

I'm not sure what the point of a comparison function is if we don't implement a total ordering. The main place cmp methods get used is in sorting. If you have a large list of objects, and, for example, you want to know whether X is in the list, you might find this out by looping over the whole

[sage-devel] trac server

Is the trac server slow this week, or is it just because I'm in Canada? -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more

[sage-devel] Dodgson condensation

http://en.wikipedia.org/wiki/Dodgson_condensation Chris Godsil pointed out to me yesterday that determinants over generic rings uses expansion by minors, which is exponential. Much better would be to use Charles Dodgson's method, which is cubic, described in the link above. This might be a fun

Re: [sage-devel] Re: Dodgson condensation

On Wed, Aug 4, 2010 at 10:14 AM, Sebastian Pancratz s...@pancratz.org wrote: Actually, I don't think it does. I was too eager to put a Lewis Carroll quote on sage-devel. I knew I should have investigated this claim before posting. Also suspect is the O(n^3) claim. If it is true, it might still

Re: [sage-devel] Re: complementary problem

Nils, So you want Sage Sets to implement a b to mean a is a subset of b? I'll admit that that is reasonable, and it is a fact that it follows Python convention. But I think that the Python convention is bizarre, especially given how they implement sorting lists. I would also rather the sort

Re: [sage-devel] Re: complementary problem

Also, consider the fact that many Sage functions use return sorted(output) to guarantee a consistent ordering of the output. What you're advocating means that this wouldn't work in many cases... On Wed, Aug 4, 2010 at 4:16 PM, Robert Miller r...@rlmiller.org wrote: Nils, So you want Sage Sets

Re: [sage-devel] Re: complementary problem

On Wed, Aug 4, 2010 at 5:51 PM, Nils Bruin nbr...@sfu.ca wrote: On Aug 4, 1:16 pm, Robert Miller r...@rlmiller.org wrote: So you want Sage Sets to implement a b to mean a is a subset of b? I'll admit that that is reasonable, and it is a fact that it follows Python convention. My initial

Re: [sage-devel] Re: complementary problem

of order of definition or memory location. Not necessary-- see below. On Wed, Aug 4, 2010 at 7:20 PM, Nils Bruin nbr...@sfu.ca wrote: On Aug 4, 3:14 pm, Robert Miller r...@rlmiller.org wrote: If Python jumped off a cliff... Then Sage might as well :-). Or be reimplemented in CL. Yes

Re: [sage-devel] Re: Scary things in Sage's Digraphs

On Sun, Jul 25, 2010 at 6:50 PM, Robert Miller r...@rlmiller.org wrote: On Sun, Jul 25, 2010 at 8:10 PM, Carl Witty carl.wi...@gmail.com wrote: You seem to want to make the vertex dictionary respect the equivalence relation defined by Sage equality.  If so, you're going to be in trouble, since

Re: [sage-devel] complementary problem

This entire problem is fixed by implementing proper comparison for Sage Sets: http://trac.sagemath.org/sage_trac/ticket/9677 -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to

Re: [sage-devel] Re: Scary things in Sage's Digraphs

On Tue, Aug 3, 2010 at 2:29 PM, William Stein wst...@gmail.com wrote: +1    It makes no sense for to mean subset because should be a total order. If you want to check for subsets we should use a method like in python: sage: a = set([1,2,3]) sage: b = set([2,3,4]) sage: a.issubset(b)

Re: [sage-devel] Re: Scary things in Sage's Digraphs

See trac #9610 for a patch which fixes this issue. -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group

Re: [sage-devel] can't -sdist a -bdist copy of Sage

On Mon, Jul 26, 2010 at 6:21 AM, William Stein wst...@gmail.com wrote: Sdist should 100% work from a binary.  That it doesn't now is a bug. This used to work - I remember doing sage releases myself starting from a binary. I thought binaries only included place holders for the spkg's? --

Re: [sage-devel] #9456 I made a mistake - can someone check I've corrected it ok

On Mon, Jul 26, 2010 at 3:24 PM, Dr. David Kirkby david.kir...@onetel.net wrote: I wish there was a central server where one just checked out the latest version of deps, then committed it back once once a ticket got positive review. That could save a lot of this hassle, with endless tickets

Re: [sage-devel] Re: Scary things in Sage's Digraphs

Nathann, Using the following instead fixes the problem: g.add_edges( (Mod(i,n),Mod(i+j,n)) for i in range(n) for j in range(1,k+1) ) This is more consistent, since we are actually using the same vertex objects. However, that should just work, right? Why doesn't it? This is coming from the code

Re: [sage-devel] Re: Scary things in Sage's Digraphs

Nathann, I understood from your explanation why Mod(1,n) is considered different from 0, and it is to me the correct behaviour... But what about this g has 21 vertices len(g.vertices) == 20 ? Sorry if you answered already ! :-) I think the information was there, but I was not very clear.

Re: [sage-devel] Re: Scary things in Sage's Digraphs

On Sun, Jul 25, 2010 at 2:01 PM, Nathann Cohen nathann.co...@gmail.com wrote: Nononon, I understood why there are two copies of what appears to be a zero, and I think it's fine like that ! This is definitely *not* fine, since we have sage: int(0) == Mod(0, 20) True As input, the

Re: [sage-devel] Re: Scary things in Sage's Digraphs

On Sun, Jul 25, 2010 at 8:10 PM, Carl Witty carl.wi...@gmail.com wrote: You seem to want to make the vertex dictionary respect the equivalence relation defined by Sage equality.  If so, you're going to be in trouble, since Sage equality actually is not an equivalence relation: Is it really too

Re: [sage-combinat-devel] Python, Sage, categories

On Fri, Jul 23, 2010 at 10:05 PM, William Stein wst...@gmail.com wrote: Anyway, a slowdown of more than 1 microsecond on everything throughout sage is absolutely unacceptable. +1 -- Robert L. Miller http://www.rlmiller.org/ -- You received this message because you are subscribed to

Re: [sage-devel] Re: New Networkx spkg

On Fri, Jul 23, 2010 at 10:18 PM, Ben Edwards bjedwa...@gmail.com wrote: As I am working on patching this, I wonder if we shouldn't have an API change in sage. Currently several functions, namely cliques_number_of take a 'with_labels' argument as a Bool to determine whether a dictionary of

Re: [sage-devel] Sorting vertices of a graph

I would simply add a caveat to the documentation. Most users use either integers for vertices, or a set of certain kinds of objects. It should be noted that should implement a total ordering for this to be consistent, e.g. not just a poset. This is related to a debate about whether should give

Re: [sage-devel] complementary problem

Chris, On Mon, Jul 12, 2010 at 7:49 PM, Chris Godsil cgod...@uwaterloo.ca wrote: ... its the complicated vertices that are causing the problem, I expect. The problem is that the comparison operators in Python for sets implement the subset notion, and thus do not provide a proper sorting of a

Re: [sage-devel] M4RIE: linear algebra over small extensions of GF(2)

On Wed, Jul 21, 2010 at 3:58 PM, Martin Albrecht martinralbre...@googlemail.com wrote: Anyway ... question: Do we want my new code in Sage? I assume nobody has replied because it's such an obvious yes! Cheers, Martin -- Robert L. Miller http://www.rlmiller.org/ -- To post to this

Re: [sage-devel] Re: graph bug or graph feature?

On Fri, Jul 23, 2010 at 4:59 AM, Nathann Cohen nathann.co...@gmail.com wrote: Agreed. Let's rewrite this one efficiently ! +1 -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to

Re: [sage-devel] Re: New Networkx spkg

Ben, On Wed, Jul 21, 2010 at 10:32 PM, Ben Edwards bjedwa...@gmail.com wrote: For the life of me I can't figure out how to upload it to google groups, here is a link http://www.cs.unm.edu/~bedwards/networkx-1.1.spkg Do you have a trac account? You should create one if you don't, at

Re: [sage-devel] sage-4.5 spkg

On Mon, Jul 19, 2010 at 1:18 PM, François Bissey f.r.bis...@massey.ac.nz wrote: Hi, We have noticed in sage-on-gentoo that the sage-4.5 tarball has been available for a few days but not the individual spkgs as far as we can see. Which means that sage -upgrade doesn't upgrade anything and we

[sage-devel] sage-4.5.1 released

Hello everyone, The release note can be found here (I've folded 4.5 into 4.5.1): http://sage.math.washington.edu/home/rlmill/sage-4.5.1.txt The source tarball is here: http://sage.math.washington.edu/home/release/sage-4.5.1.tar Upgrading is slightly broken, but not terribly so like in

[sage-devel] building documentation in parallel

This was asked in [1], but drowned in a sea of other noise. I'd like to re-ask the question on a fresh thread. On Jul 6, 8:37 am, John H Palmieri wrote: Although not exactly part of the build process, building the documentation takes a long time. Can we speed that up? Can sphinx build in

Re: [sage-devel] sage-4.5 final build failure of 'gd' on sage.math

I get this error as well. It is sad that sage.math is now one of those weird system setups where sage doesn't build in parallel. All I did was export MAKE='make -jN'... -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To

Re: [sage-devel] sage-4.5 final build failure of 'gd' on sage.math

On Sun, Jul 18, 2010 at 12:14 PM, Dr. David Kirkby david.kir...@onetel.net wrote: On 07/18/10 10:56 AM, Robert Miller wrote: I get this error as well. It is sad that sage.math is now one of those weird system setups where sage doesn't build in parallel. All I did was export MAKE='make -jN

[sage-devel] Re: ATLAS - proposal to allow a threaded build.

With the rest of the packages, we just do export MAKE=make -j6 to enable parallel building. Why don't we just use this in atlas as well? Why do we need to make a special case? -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email

[sage-devel] graph_plot.py : Image width or height is zero in IHDR

Although http://trac.sagemath.org/sage_trac/ticket/5906 was supposed to eliminate this problem for good, sometimes random (i.e. spring-layout) algorithms seem to trigger it, in particular when a short path happens to get put into a straight vertical or horizontal line. What surprises me is that

Re: [sage-devel] Re: Re: [sage-release] Re: sage-4.5.rc1 released

John, Sage built fine for me on eno. I'm running tests now. My install.log is here: http://sage.math.washington.edu/home/rlmill/sage-4.5.rc1.eno.install.log I'll try taurus next. -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to

Re: [sage-devel] Two new (or relatively new) doctest failures on t2.math

On Tue, Jul 13, 2010 at 8:19 PM, Dr. David Kirkby david.kir...@onetel.net wrote: On 07/13/10 03:51 PM, Robert Miller wrote: On Tue, Jul 13, 2010 at 4:45 PM, Dr. David Kirkby david.kir...@onetel.net  wrote: 2) sage -t -long devel/sage/sage/libs/galrep/wrapper.pyx Andrew Sutherland's

Re: [sage-devel] Two new (or relatively new) doctest failures on t2.math

On Tue, Jul 13, 2010 at 4:45 PM, Dr. David Kirkby david.kir...@onetel.net wrote: 2) sage -t -long devel/sage/sage/libs/galrep/wrapper.pyx Andrew Sutherland's Probabilistic Image of Galois Algorithm AUTHOR:   - William Stein, 2010-03 -- wrote the Cython wrapper   - Sutherland -- wrote the C

Re: [sage-devel] Re: Do not close tickets

I am sorry for that. Don't be! Just to be perfectly clear, I'm not trying to be totalitarian here. I think the following is a good rule of thumb: If there is anything on the ticket that needs to be merged, even if it is part of another ticket or implied by another ticket, or there is anyone

[sage-devel] Do not close tickets

I'd just like to remind everyone: Only the release manager should close tickets. Tim Dumol has closed #7379, even though there was a sage library patch there which needed to be merged. This is causing 4.5.rc0 to fail in much worse ways than it should. If you close tickets yourself you may be

Re: [sage-devel] Do not close tickets

This would be a good reason for us to setup a separate trac server for the notebook. I was thinking the same exact thing! +1 -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to

Re: [sage-devel] Do not close tickets

So you and William are interpreting this differently. Dave, I think you'll find that William and I have the same opinion about closing tickets -- you're unfortunately trying to absolutely generalize what I'm saying. You haven't caused any trouble by closing tickets, but it is very easy for many

Re: [sage-devel] Do not close tickets

On Mon, Jul 12, 2010 at 10:47 AM, David Kirkby david.kir...@onetel.net wrote: On 12 July 2010 09:05, William Stein wst...@gmail.com wrote:  http://trac.sagemath.org/sage_notebook is a trac just for the notebook. It's a broken link for me. It was a hypothetical link for everyone. Dave

Re: [sage-devel] Re: Do not close tickets

On Mon, Jul 12, 2010 at 12:15 PM, Simon King simon.k...@nuigalway.ie wrote: Hi Robert and William, What does closing a ticket mean? Is it the same as providing a resolution such as fixed, wontfix, duplicate? Or is closing the ticket something that comes *after* providing a resolution? If

Re: [sage-devel] proposal: put more files under revision control

I sometimes wonder if it would be better if there was only one repository for things except .spkg files. Perhaps rather than going from 2 to 3 repositories, we should go from 2 to 1, and stick everything in the new $SAGE_ROOT repository. (I suspect one can merge repositories, so information

[sage-devel] Re: trac workflow

Ping! I'd like to repeat my request, since I have just discovered yet another edge that needs adding: positive_review -- needs_info On Thu, Jun 24, 2010 at 11:05 AM, Robert Miller r...@rlmiller.org wrote: Hello, I'd like to make some tweaks to the workflow on Sage's trac server

Re: [sage-devel] coincidence?

Wow. I would have rather won the lottery! On Wed, Jun 30, 2010 at 7:25 AM, John Cremona john.crem...@gmail.com wrote: Is this really true: j...@selmer%ls -l sage-4.5* -rw-r--r-- 1 jec    jec    304875520 2010-06-26 02:42 sage-4.5.alpha0.tar -rw-rw-rw- 1 masiao masiao 304875520 2010-06-29

[sage-devel] is loads(dumps(... an indirect doctest?

I was recently searching through the source and I noticed that some loads/dumps doctests say #indirect doctest, and others don't. I know that for __reduce__ methods, this is correct, but it struck me that perhaps all loads/dumps doctests are indirect. I guess this is a philosophical/moral

Re: [sage-devel] is loads(dumps(... an indirect doctest?

On Wed, Jun 30, 2010 at 10:01 AM, William Stein wst...@gmail.com wrote: On Wed, Jun 30, 2010 at 9:48 AM, Robert Miller r...@rlmiller.org wrote: I was recently searching through the source and I noticed that some loads/dumps doctests say #indirect doctest, and others don't. I know

[sage-devel] Re: non-QQ base rings in modular symbols

The patch is up: http://trac.sagemath.org/sage_trac/ticket/9376 I haven't tested it thoroughly yet. -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this

Re: [sage-devel] Re: Fwd: William, Write a Sagemath Book for Packt Publishing!

sage-flame? On Mon, Jun 28, 2010 at 4:47 PM, Bill Hart goodwillh...@googlemail.com wrote: Then I don't understand. What do you mean by free? I don't see how anything at all about Springer exemplifies even a beginning of an understanding. They are to me the archetypal proprietary publisher...

Re: [sage-devel] Ownership of Sage trac components.

But for several there the owner is tbd which I assume means to be determined and so there is no real owner. The following have no owner cygwin, debian-package, distribution, dsage, experimental package, factorization, memleak, msvc, packages, performance, relocation and spkg-check. Feel

Re: [sage-devel] Ownership of Sage trac components.

On Sun, Jun 27, 2010 at 1:05 PM, Dr. David Kirkby david.kir...@onetel.net wrote: On 06/27/10 08:55 PM, Robert Miller wrote: Feel free to put me in charge of the memleak component. Done. As a matter of interest, what techniques are you using for memory leak testing? I assume valgrind is one

[sage-devel] Fwd: trac tickets needing review (#8981 Adding support for param attribute of GSL ode solver)

I am forwarding your request to sage-devel, since I'm not sure who to suggest. -- Forwarded message -- From: André-Patrick Bubel kont...@andre-bubel.de Date: Sat, Jun 26, 2010 at 7:42 PM Subject: Re: trac tickets needing review To: Robert Miller r...@rlmiller.org Hi, I don't

Re: [sage-devel] GLPK Package - needs extensive testing

I guess someone should open a ticket for this to be added as a standard package, then it tested extensively before being committed. A few things should happen before we make this a standard spkg. First, I think we should merge all the newly-positive-reviewed graph theory tickets using LP, to

Re: [sage-devel] Souvigner optional package does not exist?

Anna, Welcome to the group! It looks like this code comes from the following ticket: http://trac.sagemath.org/sage_trac/ticket/4470 in which Michael Abshoff comments: commit 10629 is mostly the AUTO code by Bernd Souvignier - the code has been made available under a GPL V2+ compatible

Re: [sage-devel] GLPK license and version

 Excuse me for interrupting a technical discussion, but I just wanted to ask what is wrong with licensing Sage under GPLv3? Sage is a free software, am I right. I thought that all GPLs are for free software and that all of them do guarantee freedom to use and modify the software. For one,

[sage-devel] padics, precision, list() and printing

I'm curious about the following behavior: sage: E = EllipticCurve('37a') sage: R = E.padic_regulator(7) sage: len(R.list()) 37 sage: s = str(R) sage: len(R.list()) 19 (PS - The default precision for padic_regulator is 20). The documentation doesn't say anything about what length to expect the

[sage-devel] notebook from sage.math, geom.math

I have an installation of sage-4.4.4.alpha1 on geom.math for which the following command works: notebook(interface='geom.math.washington.edu', port=9876, secure=True, open_viewer=False) But on sage.math, the same command: notebook(interface='sage.math.washington.edu', port=9876, secure=True,

Re: [sage-devel] Re: Vote for including GLPK standard in Sage

On Mon, Jun 21, 2010 at 11:02 PM, Dr David Kirkby drkir...@gmail.com wrote: The package does not even add the -m64 flag, so will not build on OpenSolaris x64 or on some Macs - it completley ignores the SAGE64 variable. So whilst the package could be made to work, as it is, I think it should

Re: [sage-devel] GPLK quesitons

sed -i 's/GPLK/GLPK/g' this-thread ;) -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL:

[sage-devel] Windows README files out of date

http://www.sagemath.org/mirror/win/ has a couple README files which indicate that to develop in Sage you can ssh into the virtual machine and develop that way. They tell you to use login and sage as credentials. This is out of date since the current credentials are sage and sage. Can someone

[sage-devel] Vote for including GLPK standard in Sage

Hello, Almost a year ago there was a brief discussion about this topic: http://groups.google.com/group/sage-devel/browse_thread/thread/fed15c54478e8d5 GLPK is a GPLv3 program from the FSF for linear programming: http://www.gnu.org/software/glpk/ Many of the awesome graph theory functions

Re: [sage-devel] Re: Vote for including GLPK standard in Sage

On Mon, Jun 21, 2010 at 11:34 AM, kcrisman kcris...@gmail.com wrote: As long as there are no licensing issues, we *definitely* need something for semi-serious LP (and I don't even use it!).  If this is the most obvious candidate for an official package, do it.  It's not more than another 100

Re: [sage-devel] Vote for including GLPK standard in Sage

Build time? On my MacBook, under two minutes: $ time sage -f glpk ... real1m25.964s user0m58.227s sys 0m14.410s Tested on solaris? Tested on cygwin? Sorry, but I have no idea... -- Robert L. Miller http://www.rlmiller.org/ -- To post to this group, send an email to

[sage-devel] only-optional

Learning about the sage -t -only-optional argument, I'm noticing that there are quite a few modules which don't use the proper syntax. If the doctest is followed by a # optional -- pkg1, pkg2, pkg3 and the tester calls sage -t [...] -only-optional=pkg4,pkg5,[...]pkg6 then the doctest will be

[sage-devel] Re: only-optional

On Jun 18, 3:21 pm, Robert Miller r...@rlmiller.org wrote: Right now I'm fixing this in the graphs directory... See http://trac.sagemath.org/sage_trac/ticket/9269 -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage

Re: [sage-devel] Re: only-optional

On Fri, Jun 18, 2010 at 5:21 PM, John H Palmieri jhpalmier...@gmail.com wrote: Is the proper syntax documented anywhere? I can't find it. I could only find mention of it here: $ ./sage -advanced ... -t [-verbose] [-long] [-optional] [-only-optional=list,of,tags] files|dir --

[sage-devel] WorldMap graph

Why is it that we have the World graph hard-coded? Wouldn't it be better to get an up-to-date world graph? (There are 100 more countries on the CIA factbook---referred to in the docstring---than there are in the returned graph). What about including instructions in the docstring, or even code, to

Re: [sage-devel] Re: factorial() and gamma()

At the moment there does not seem to be a clear consensus either way. If you have an opinion on this, please vote!  Let x be an explicit numerical value such that x is not a non-negative integer (e.g. x=2/3, x=1.5, or x=i).  The options are: A)  factorial(x) should raise an error; B)  

Re: [sage-devel] pushing towards 90% doctest coverage for Sage 5.0

Minh, On Fri, Jun 11, 2010 at 2:49 AM, Minh Nguyen nguyenmi...@gmail.com wrote: Here is my understanding of what you want. Let's say the Sage community has enough time to write tests for 20 modules. Which 20 modules could we choose to write tests for such that it results in the greatest

  1   2   3   4   >