[sage-combinat-devel] Re: To what extent path algebras are currently available in Sage?

2012-11-21 Thread Volker Braun
I haven't tried QPA but it seems to be a pure GAP script, so I would expect 
that performance will be comparable to a pure Python implementation. But it 
looks like a very nice project and its likely that it would be of some use 
even if the core computations of a Sage quiver module were implemented 
differently.

A C++/Cython implementation of the basic path algebra arithmetic with 
bit-packed exponents and arbitrary coefficient rings would be a nice thing 
to have though ;-)






On Wednesday, November 21, 2012 11:45:39 AM UTC, Simon King wrote:

 Hi Combinat folks! 

 I see on the Sage Combinat Road Map on trac that there are some tickets 
 dedicated to path algebras: #9889, #12630 and something which appears to 
 have no ticket yet, namely an interface to QPA in Gap. 

 What I'd need is: Path algebras over an arbitrary finite quiver 
 (loops will occur) with coefficients in a finite field (non-prime fields 
 will occur). The path algebras will be equipped with a monomial ordering 
 (monomials corresponding to paths). And of course the implementation 
 should be very efficient in basic arithmetics, in comparison of monomials, 
 and in using monomials as cache keys. 

 - Am I right that those things are currently unavailable in Sage? 
 - Am I right that #12630 would not help me, since it is restricted to 
   the loop-less case? 
 - Am I right that #9889 would not help me, since it is pure Python and 
   thus not very efficient, and does not provide monomial orderings? 
 - I had a look at the QPA package - it looks like it would do the right 
   things for me (there is even talk about Gröbner bases and Ext 
   algebras, which is totally in my scope), but the package is not in the 
   list of accepted packages and not even in the list of deposited 
   packages of GAP. Do you know whether the implementation is 
   competitive? Is there a ticket to make it available in Sage? 

 So, what do you recommend to do? Try to use QPA in Sage via the new 
 libGAP (I guess the GAP pexpect interface would be too slow)? Or try and 
 write my own implementation? 

 Cheers, 
 Simon 




-- 
You received this message because you are subscribed to the Google Groups 
sage-combinat-devel group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/sage-combinat-devel/-/ltC_jTAPSuwJ.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/sage-combinat-devel?hl=en.



Re: [sage-combinat-devel] Sage-combinat repo down

2012-11-21 Thread William Stein
Hi,

On Monday, Andrew Ohana and I re-seated DIMM C3 in
combinat.math.washington.edu.  So far (2 days later) the machine is up
and working fine.

-- William

On Fri, Nov 16, 2012 at 1:02 PM, Travis Scrimshaw tsc...@ucdavis.edu wrote:
 Thank you for taking care of this.

 Thanks,
 Travis


 On Thursday, November 15, 2012 2:09:46 PM UTC-8, William Stein wrote:

 Hi,

 I power cycled the machine.  It stated clearly on the display that a
 memory cheap *must* be re-seated.  I hope I can do this tomorrow
 morning, which will of course mean downtime.

 I don't know how hard it will be to figure out which chip DIMM C3
 actually is. The machine has a *lot* of memory chips in it.

 In the meantime, I suggest moving the combinat repo to another machine.

  -- William


 On Thu, Nov 15, 2012 at 12:27 PM, William Stein wst...@gmail.com wrote:
  There may be a memory issue.  I'm going to the server room to
  physically reboot it again right now.
 
  On Thu, Nov 15, 2012 at 9:27 AM, Travis Scrimshaw tsc...@ucdavis.edu
  wrote:
  Hey,
 Sorry to sound like a broken record, but I believe the sage-combinat
  server is down again. What's the status on getting it back up?
 
  Thanks,
  Travis
 
  --
  You received this message because you are subscribed to the Google
  Groups
  sage-combinat-devel group.
  To view this discussion on the web visit
  https://groups.google.com/d/msg/sage-combinat-devel/-/-oTs4VAzqAwJ.
  To post to this group, send email to sage-comb...@googlegroups.com.
  To unsubscribe from this group, send email to
  sage-combinat-devel+unsubscr...@googlegroups.com.
  For more options, visit this group at
  http://groups.google.com/group/sage-combinat-devel?hl=en.
 
 
 
  --
  William Stein
  Professor of Mathematics
  University of Washington
  http://wstein.org



 --
 William Stein
 Professor of Mathematics
 University of Washington
 http://wstein.org

 --
 You received this message because you are subscribed to the Google Groups
 sage-combinat-devel group.
 To view this discussion on the web visit
 https://groups.google.com/d/msg/sage-combinat-devel/-/L6qOF5ygxdYJ.

 To post to this group, send email to sage-combinat-devel@googlegroups.com.
 To unsubscribe from this group, send email to
 sage-combinat-devel+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/sage-combinat-devel?hl=en.



-- 
William Stein
Professor of Mathematics
University of Washington
http://wstein.org

-- 
You received this message because you are subscribed to the Google Groups 
sage-combinat-devel group.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/sage-combinat-devel?hl=en.



[sage-combinat-devel] Re: To what extent path algebras are currently available in Sage?

2012-11-21 Thread Simon King
Hi Volker,

Am Mittwoch, 21. November 2012 13:52:15 UTC+1 schrieb Volker Braun:

 A C++/Cython implementation of the basic path algebra arithmetic with 
 bit-packed exponents and arbitrary coefficient rings would be a nice thing 
 to have though ;-)


Bit packed exponents? What does that mean in a path algebra? I thought that 
monomials (i.e., paths in the quiver) would rather be represented by lists 
of integers, the integers being the labels of arrows in the quiver.

Cheers,
Simon 

-- 
You received this message because you are subscribed to the Google Groups 
sage-combinat-devel group.
To view this discussion on the web visit 
https://groups.google.com/d/msg/sage-combinat-devel/-/Zc7NNWT7_nYJ.
To post to this group, send email to sage-combinat-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-combinat-devel+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/sage-combinat-devel?hl=en.



[sage-devel] Re: Combining finite/rational fields

2012-11-21 Thread Dima Pasechnik
On 2012-11-19, Nils Bruin nbr...@sfu.ca wrote:
 On Nov 19, 6:22 am, Dima Pasechnik dimp...@gmail.com wrote:

 Perhaps the coersion system itself might be a bit confused, but
 it looks like here we talk rigour for the sake of rigour, without
 any benefits.

 One benefit is error detection and picking proper normalizations. For
 instance, if you create a reduction map from a projective variety to
 one over GF(p), denominators need to be cleared. First you need to
 clear them from the equations, but assuming you did that, it's also
 important that you properly clear denominators from the
 representatives for your projective points (i.e, the projective point
 (1:1/p) should be represented by (p:1) before it gets mapped over).

 However, projective points over Q usually do normalized with a 1 in a
 given coordinate, forcing denominators elsewhere. With an automatic
 coercion you may well succeed in defining a map, only to find it
 doesn't evaluate in points where you thought it should.

hmm, I don't think this example will fly. If you happen to have a
divisior of p in the denominator then you get a point with every 
nonzero coordinate divisible by p. So the reduction of it is
(0:0..:0) -- oeps --- a runtime error sowieso...


 Nasty complications with the coercion framework always happen a couple
 of levels removed from the source of the problems, so I've given up on
 only guarding against problems I can imagine and prefer the more
 defensive stance of sticking with what is mathematically guaranteed to
 work. If we ensure there are reasonable ways to loosen the stringent
 defaults I think we can still end up with a workable system.

 Conceptually, field division is a partial map too.

 Yes, and it always is. So assuming it's not will surely be a bug.

Don't you think it's totally inconsequent that Sage 
can divide an element of GF(p) by an integer (and sometimes get a
runtime error, sure), but Sage cannot multiply by the inverse of this 
integer? This looks like a bug, actually, IMHO.


-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Error building in mandriva.

2012-11-21 Thread Eric Gourgoulhon
Hi,

I had the same problem with Sage 5.4 on Mandriva 2010.1. As explained in 
the post 
https://groups.google.com/d/topic/sage-devel/7BpVcXiN9Cg/discussion, the 
problem arises from the function time. 
A workaround is to edit the file 
$SAGE_ROOT/spkg/bin/sage
and to suppress the time command in the definition of the function 
build_sage() (line 650 of the file for Sage 5.4), so that it becomes
build_sage() {
sage-build $@ || exit $?
}
Then, the installation proceeds successfully. 

Eric. 

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Sage-5.4 virtual appliance

2012-11-21 Thread Andrea Lazzarotto
2012/11/13 Volker Braun vbraun.n...@gmail.com

 I don't have the bandwidth right now to try it myself, but the VM build
 script ran fine. The adventurous can find the virtual machine image here:


For me it's broken. Basically, if I run it I see it loops a lot and the GUI
doesn't start. But if I switch to a tty I can login with the various users.


 I'm also pretty sure that automatic login to the notebook is still broken,
 requiring you to make a notebook account in the VM first before you can use
 it


I don't understand the problem. You say This is not an option for the
virtual machine, you can't start a host browser from within the VM. But
actually, if you correctly set the XDG variables correctly, sage
-notebookwill automatically start the browser for you. It will be even
simpler
because you don't need to have two different users... I can have a look if
you help me to solve the looping issue.

Also, can you clarify why you're running Chrome in the VM? It's not even
open source.

Thank you, best regards.

-- 
*Andrea Lazzarotto* - http://andrealazzarotto.com*
*

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Sage-5.4 virtual appliance

2012-11-21 Thread Volker Braun
I've just posted a new VM. As I wrote in the other thread, the new VM 
doesn't isolate the gui user from the Sage server any more so automatic 
login works inside the VM. It does not and currently can not work if you 
use the host OS web browser.

Chromium isn't in Fedora at this point so it was just easier to pull in the 
Google chrome repo. Javascript performance is pretty important for the Sage 
notebook, which is why I prefer it in the VM.



On Wednesday, November 21, 2012 1:46:38 PM UTC, Andrea Lazzarotto wrote:



 2012/11/13 Volker Braun vbrau...@gmail.com javascript:

 I don't have the bandwidth right now to try it myself, but the VM build 
 script ran fine. The adventurous can find the virtual machine image here:


 For me it's broken. Basically, if I run it I see it loops a lot and the 
 GUI doesn't start. But if I switch to a tty I can login with the various 
 users.
  

 I'm also pretty sure that automatic login to the notebook is still 
 broken, requiring you to make a notebook account in the VM first before you 
 can use it


 I don't understand the problem. You say This is not an option for the 
 virtual machine, you can't start a host browser from within the VM. But 
 actually, if you correctly set the XDG variables correctly, sage 
 -notebookwill automatically start the browser for you. It will be even 
 simpler 
 because you don't need to have two different users... I can have a look if 
 you help me to solve the looping issue.

 Also, can you clarify why you're running Chrome in the VM? It's not even 
 open source.

 Thank you, best regards.

 -- 
 *Andrea Lazzarotto* - http://andrealazzarotto.com*
 *


-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Combining finite/rational fields

2012-11-21 Thread P Purkayastha

On 11/19/2012 02:06 AM, Nils Bruin wrote:

On Nov 18, 9:22 am, Dima Pasechnik dimp...@gmail.com wrote:


How different is rational number*finite field element
from division, which is also a partial operation?
(Well, I admit I don't know Sage's coersion model at all...)


Robert is probably more qualified to explain, but I'll try for now.
Both
finite field element * rational number
and
finite field element / integer
fit the pattern
element of A binary operation element of B

In order to make sense of this, sage tries to find/construct a
minimal common parent C into which both A and B coerce. Integers
coerce into finite fields; all of them. It's the operation that later
fails.

Rationals don't coerce into finite fields and that's probably a good
thing.

How damaging would it be to borrow the same mechanism as scalar
multiplication for this, i.e., define a partial action of Q on
GF(p)?

How much would we gain by doing so? If we don't automatically get a
partial action of Q on GF(p)['x'] and VectorSpace(GF(p),3) it's
probably not worth the effort.



In fact, the behavior in Sage is *inconsistent*, and I think in this 
particular case, the inconsistency should get priority of getting fixed 
over trying to enforce rigor.:



sage: GF(7)(4)*2/3
5
sage: 2/3*GF(7)(4)
TypeError: unsupported operand parent(s) for '*': 'Rational Field' and 
'Finite Field of size 7'



By following precedence in evaluation, the first one works while the 
second one doesn't. Mathematically speaking, if the first one gives a 
particular answer, then the second one should also give the same answer, 
as should


sage: GF(7)(4)*(2/3)

which also fails because of precedence in the evaluation.

It is not like it is hard to coerce the numbers into the finite field, 
because the numerator and the denominators can be individually accessed 
by doing (2/3).numerator() and (2/3).denominator().



--
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Combining finite/rational fields

2012-11-21 Thread Simon King
Hi all!

On 2012-11-21, P Purkayastha ppu...@gmail.com wrote:
 In fact, the behavior in Sage is *inconsistent*, and I think in this 
 particular case, the inconsistency should get priority of getting fixed 
 over trying to enforce rigor.:

I wouldn't think it is a fix, *unless* it is done in a rigorous way.

What's the problem here? We can devide the elements of one integral domain
R1 by some elements of another integral domain R2, but (for good reasons!)
we can't multiply elements of R1 with elements of the fraction field of R2.

A potential solution (and it could be that this is what you suggested)
is to say: If there is a coercion map phi of R2 into R1, then Frac(R2)
acts on R1 by multiplication, via (p/q)*r1 = phi(p)*r1/phi(q).

I do think this would comply with Sage's category framework. I don't
recall the name of the methods that need to be provided for implementing
an action (act_on?), but I think it would be possible to provide a
generic implementation for fraction field elements.

Cheers,
Simon

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Sage-5.4 virtual appliance

2012-11-21 Thread Andrea Lazzarotto
2012/11/21 Volker Braun vbraun.n...@gmail.com

 I've just posted a new VM. As I wrote in the other thread, the new VM
 doesn't isolate the gui user from the Sage server any more so automatic
 login works inside the VM.


Sorry, I don't understand the other thread you are referring to. Is it in
this mailing list or in another one? I'm not subscribed to all Sage related
lists ATM. I looked at the *Index Of* in your URL and saw the new date. I
will download it immediately. :)


 Chromium isn't in Fedora


OMG. o.O
By the way, I just *DuckDuckGo*-ed a bit and found that there is an
unofficial repository: http://fedoraproject.org/wiki/Chromium
I know, using completely open source software may not be the priority, but
it can be nice. :)


 Javascript performance is pretty important for the Sage notebook, which is
 why I prefer it in the VM.


Does it mean Firefox is slower with that? What about e.g. Midori? AFAIK it
uses Webkit too.

Thank you for your answer and excuse me for not finding the other thread.

Best regards,

-- 
*Andrea Lazzarotto* - http://andrealazzarotto.com*
*

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Combining finite/rational fields

2012-11-21 Thread P Purkayastha

On 11/21/2012 10:53 PM, Simon King wrote:

Hi all!

On 2012-11-21, P Purkayastha ppu...@gmail.com wrote:

In fact, the behavior in Sage is *inconsistent*, and I think in this
particular case, the inconsistency should get priority of getting fixed
over trying to enforce rigor.:


I wouldn't think it is a fix, *unless* it is done in a rigorous way.

What's the problem here? We can devide the elements of one integral domain
R1 by some elements of another integral domain R2, but (for good reasons!)
we can't multiply elements of R1 with elements of the fraction field of R2.

A potential solution (and it could be that this is what you suggested)
is to say: If there is a coercion map phi of R2 into R1, then Frac(R2)
acts on R1 by multiplication, via (p/q)*r1 = phi(p)*r1/phi(q).


What I am asking for is quite simple. If I see a fractional element f = 
p/q during multiplication or division (like p/q*alpha) then in the 
appropriate operation, I would simply run


self(f.numerator())/self(f.denominator())*alpha.

Probably there are more efficient ways of doing this. This brings me to 
the last problem:


GF(5)(3) + 2/3 or 2/3 + GF(5)(3), both result in errors. If we allow 
multiplication, then again there is an inconsistency with addition and 
subtraction. Any ideas what should be done here? Is it always correct to 
coerce to the finite field?



--
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Combining finite/rational fields

2012-11-21 Thread Dima Pasechnik
On 2012-11-21, Simon King simon.k...@uni-jena.de wrote:
 Hi all!

 On 2012-11-21, P Purkayastha ppu...@gmail.com wrote:
 In fact, the behavior in Sage is *inconsistent*, and I think in this 
 particular case, the inconsistency should get priority of getting fixed 
 over trying to enforce rigor.:

 I wouldn't think it is a fix, *unless* it is done in a rigorous way.

 What's the problem here? We can devide the elements of one integral domain
 R1 by some elements of another integral domain R2, but (for good reasons!)
 we can't multiply elements of R1 with elements of the fraction field of R2.

I don't follow this. Why can we divide more than multiply? What
GF(7)(5)/3 does, it multiplies GF(7)(5) by the element 1/3 of QQ. And
GF(7)(5)/14 fails at runtime just as (not yet allowed) GF(7)(5)*(1/14)
would.  To be completely kosher, one might talk about GF(7)(5)*(1/3) as
multiplication of an element of GF(7) and an element of Z_{(7)}.

[I cannot resist quoting a russian joke, about policemen knowing only
two arithmetic operations: subtraction and division...]

Best,
Dima


 A potential solution (and it could be that this is what you suggested)
 is to say: If there is a coercion map phi of R2 into R1, then Frac(R2)
 acts on R1 by multiplication, via (p/q)*r1 = phi(p)*r1/phi(q).

 I do think this would comply with Sage's category framework. I don't
 recall the name of the methods that need to be provided for implementing
 an action (act_on?), but I think it would be possible to provide a
 generic implementation for fraction field elements.

 Cheers,
 Simon


-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Combining finite/rational fields

2012-11-21 Thread Dima Pasechnik
On 2012-11-21, P Purkayastha ppu...@gmail.com wrote:
 On 11/21/2012 10:53 PM, Simon King wrote:
 Hi all!

 On 2012-11-21, P Purkayastha ppu...@gmail.com wrote:
 In fact, the behavior in Sage is *inconsistent*, and I think in this
 particular case, the inconsistency should get priority of getting fixed
 over trying to enforce rigor.:

 I wouldn't think it is a fix, *unless* it is done in a rigorous way.

 What's the problem here? We can devide the elements of one integral domain
 R1 by some elements of another integral domain R2, but (for good reasons!)
 we can't multiply elements of R1 with elements of the fraction field of R2.

 A potential solution (and it could be that this is what you suggested)
 is to say: If there is a coercion map phi of R2 into R1, then Frac(R2)
 acts on R1 by multiplication, via (p/q)*r1 = phi(p)*r1/phi(q).

 What I am asking for is quite simple. If I see a fractional element f = 
 p/q during multiplication or division (like p/q*alpha) then in the 
 appropriate operation, I would simply run

 self(f.numerator())/self(f.denominator())*alpha.

 Probably there are more efficient ways of doing this. This brings me to 
 the last problem:

 GF(5)(3) + 2/3 or 2/3 + GF(5)(3), both result in errors. If we allow 
 multiplication, then again there is an inconsistency with addition and 
 subtraction. 
no, this is OK. The thing is that the multiplication is the action of 
Z_{(5)} on Z_{(5)}/5Z_{(5)}=GF(5), i.e. GF(5) is an Z_{(5)}-module.
That's all, there is no addition correctly defined for an element of a
ring R and an element of an R-module.

Dima

 Any ideas what should be done here? Is it always correct to 
 coerce to the finite field?



-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Sage-5.4 virtual appliance

2012-11-21 Thread Volker Braun
The current thread on the Sage-5.4 VM is here:

https://groups.google.com/d/topic/sage-release/V69RDMFLyIo/discussion


On Wednesday, November 21, 2012 10:20:24 AM UTC-5, Andrea Lazzarotto wrote:

 Does it mean Firefox is slower with that? What about e.g. Midori? AFAIK it 
 uses Webkit too.


Webkit is a layout engine, not a Javascript interpreter. Google's v8 
consistently beats other implementations by a wide margin.

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Sage testing

2012-11-21 Thread Jernej Azarija
Hello!

I was wondering how is testing of Sage currently performed. 

What I was wondering is if there is a policy that for every new addition to 
sage there is also a suitable test case that is prepared to test the 
specific addition.

For example if I add the function foo() to the graph class is there a test 
file or something in which I can add some test cases to test if the return 
value of foo() is as expected? 

I believe it would be nice to have a test script for each part of sage (for 
example Graphs) such that it would test all functions and methods of the 
given part. In this way one could always keep track if some local change in 
a library/sage broke a specific functionality of sage and it would also 
allow us to time if a global change in sage made any speed improvements to 
the running time of  the tests.

As far as I've noticed there is a policy to add the respective 
documentation for each addition to sage but no policy related to such tests.

Am I correct? Is there any reason why this is not encouraged? 

Best,

Jernej

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Ubuntu 12.04: Sage fails to install from PPA - Error installing package gap_packages-4.4.12.p

2012-11-21 Thread Johannes
Hi

Am Mo 19 Nov 2012 04:47:19 CET schrieb Jan Groenewald:

 dpkg-reconfigure sagemath-optional
that does not work:
/usr/sbin/dpkg-reconfigure: sagemath-optional ist kaputt oder nicht 
komplett installiert
(package is defect or not completely installed)
if I try
dpkg-reconfigure --force sagemath-optional
I get get exactly the same error as before.

greatz Johannes

 Until you do this your package manager will stay in a broken state.
 When you run dpkg -l sagemath-optional, it should also say ii
 next to it, once you are finished.

 Regards,
 Jan



 On 18 November 2012 21:42, Johannes dajo.m...@web.de
 mailto:dajo.m...@web.de wrote:

 Hey,
 On 18.11.2012 20:23, Jan Groenewald wrote:
  Dear Johannes,
 
  How did you install? From the PPA? Is this the sagemath-optional
 trying
  to build?

 I once installed Sage by `apt-get install sagemath-optional
 sagemath-upstream-binary`

 
  Johannes, please list the installed PPA packages:
  dpkg -l |grep sagemath

 dpkg -l |grep sagemath
 iF  sagemath-optional   5.4
 ii  sagemath-upstream-binary5.4ubuntu1


  sudo apt-get update
  sudo apt-get dist-upgrade
  sudo sage -f
 /usr/lib/sagemath/spkg/optional/gap_packages-4.4.12.p1.spkg

 Installing the package by `sage -f ..` as above seems to work fine.

 greatz
 Johannes

  Regards,
  Jan
 
 
 
  On 18 November 2012 21:04, Johannes dajo.m...@web.de
 mailto:dajo.m...@web.de
  mailto:dajo.m...@web.de mailto:dajo.m...@web.de wrote:
 
  Hi list,
  I tried to upgrade my sage installation, but it fails to build:
 
  make[1]: Betrete Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/grape/nauty22'
  gcc -c -O4 -march=i686  -DBIGNAUTY -o naututilB.o naututil.c
  gcc -c -O4 -march=i686  -DBIGNAUTY -o nautyB.o nauty.c
  gcc -c -O4 -march=i686  -DBIGNAUTY -o nautilB.o nautil.c
  gcc -c -O4 -march=i686  -DBIGNAUTY -o nautinvB.o nautinv.c
  gcc -c -O4 -march=i686  -DBIGNAUTY -o naugraphB.o naugraph.c
  gcc -c -O4 -march=i686  rng.c
  gcc -o dreadnautB -O4 -march=i686 -DBIGNAUTY dreadnaut.c
 naututilB.o \
  nautyB.o nautilB.o nautinvB.o naugraphB.o rng.o
  make[1]: Verlasse Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/grape/nauty22'
  ( cd src; make BINDIR= )
  make[1]: Betrete Verzeichnis
 '/usr/lib/sagemath/local/lib/pkg/grape/src'
  gcc -O -o ../bin//drcanon4  drcanon4.c
  gcc -O -o ../bin//drtogap4  drtogap4.c
  gcc -O -o ../bin//gap4todr  gap4todr.c
  make[1]: Verlasse Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/grape/src'
  cat: ../..//sysinfo.gap: Datei oder Verzeichnis nicht gefunden
  ( test -d bin || mkdir bin; \
  test -d bin/ || mkdir bin/; cd bin/; \
  make -f ../../Makefile all2 CC=gcc CFLAGS=-O2; \
  cd ../../src/leon/src/../; ./configure; make; mkdir
  ../../bin/leon; \
  cp cent ../../bin/leon; cp cjrndper ../../bin/leon; \
  cp commut ../../bin/leon; cp compgrp ../../bin/leon; \
  cp desauto ../../bin/leon; cp fndelt ../../bin/leon; \
  cp generate ../../bin/leon; cp inter ../../bin/leon; \
  cp orbdes ../../bin/leon; cp orblist ../../bin/leon; \
  cp randobj ../../bin/leon; cp setstab ../../bin/leon; \
  cp wtdist ../../bin/leon; cp src/*.sh ../../bin/leon; \
  cp wtdist ../../bin; cp desauto ../../bin; \
  cp wtdist ../../bin/; cp desauto ../../bin/ \
  )
  make[1]: Betrete Verzeichnis
 '/usr/lib/sagemath/local/lib/pkg/guava/bin'
  make[1]: ../../Makefile: Datei oder Verzeichnis nicht gefunden
  make[1]: *** Keine Regel, um »../../Makefile« zu erstellen.
  Schluss.
  make[1]: Verlasse Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/guava/bin'
  /bin/sh: 4: cd: can't cd to ../../src/leon/src/../
  /bin/sh: 4: ./configure: not found
  make[1]: Betrete Verzeichnis
 '/usr/lib/sagemath/local/lib/pkg/guava/bin'
  make[1]: *** Keine Targets angegeben und keine
 »make«-Steuerdatei
  gefunden.  Schluss.
  make[1]: Verlasse Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/guava/bin'
  mkdir: kann Verzeichnis »../../bin/leon“ nicht anlegen:
 Datei oder
  Verzeichnis nicht gefunden
 
  my setup:
  Ubuntu 12.04
  Linux neo 3.2.0-31-generic #50-Ubuntu SMP Fri Sep 7 16:17:36
 UTC 2012
  i686 i686 i386 GNU/Linux
 
  if you need any more information, just ask, and I'll tell you.
 
  greatz and thnx,
  Johannes
 
  --
  You received this message because you are 

[sage-devel] Re: Sage testing

2012-11-21 Thread Volker Braun
A good starting point would be the Sage documentation about how to use the 
doctests:

http://lmgtfy.com/?q=sage+doctest



On Wednesday, November 21, 2012 4:20:42 PM UTC, Jernej Azarija wrote:

 Hello!

 I was wondering how is testing of Sage currently performed. 

 What I was wondering is if there is a policy that for every new addition 
 to sage there is also a suitable test case that is prepared to test the 
 specific addition.

 For example if I add the function foo() to the graph class is there a test 
 file or something in which I can add some test cases to test if the return 
 value of foo() is as expected? 

 I believe it would be nice to have a test script for each part of sage 
 (for example Graphs) such that it would test all functions and methods of 
 the given part. In this way one could always keep track if some local 
 change in a library/sage broke a specific functionality of sage and it 
 would also allow us to time if a global change in sage made any speed 
 improvements to the running time of  the tests.

 As far as I've noticed there is a policy to add the respective 
 documentation for each addition to sage but no policy related to such tests.

 Am I correct? Is there any reason why this is not encouraged? 

 Best,

 Jernej



-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Sage testing

2012-11-21 Thread P Purkayastha

On 11/22/2012 12:20 AM, Jernej Azarija wrote:

Hello!

I was wondering how is testing of Sage currently performed.

What I was wondering is if there is a policy that for every new addition
to sage there is also a suitable test case that is prepared to test the
specific addition.

For example if I add the function foo() to the graph class is there a
test file or something in which I can add some test cases to test if the
return value of foo() is as expected?

I believe it would be nice to have a test script for each part of sage
(for example Graphs) such that it would test all functions and methods
of the given part. In this way one could always keep track if some local
change in a library/sage broke a specific functionality of sage and it
would also allow us to time if a global change in sage made any speed
improvements to the running time of  the tests.

As far as I've noticed there is a policy to add the respective
documentation for each addition to sage but no policy related to such tests.

Am I correct? Is there any reason why this is not encouraged?

Best,

Jernej



The policy is to add examples and tests within your documentation. Look 
up the source code of some function like


QQ??

plot??

integrate??

and so on. You will find both examples and tests listed there.




--
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Sage testing

2012-11-21 Thread Johannes
Hey Jernej,
take a look here:
http://www.sagemath.org/doc/developer/walk_through.html#reviewing-a-patch

greatz Johannes

On 21.11.2012 17:20, Jernej Azarija wrote:
 Hello!
 
 I was wondering how is testing of Sage currently performed.
 
 What I was wondering is if there is a policy that for every new addition
 to sage there is also a suitable test case that is prepared to test the
 specific addition.
 
 For example if I add the function foo() to the graph class is there a
 test file or something in which I can add some test cases to test if the
 return value of foo() is as expected?
 
 I believe it would be nice to have a test script for each part of sage
 (for example Graphs) such that it would test all functions and methods
 of the given part. In this way one could always keep track if some local
 change in a library/sage broke a specific functionality of sage and it
 would also allow us to time if a global change in sage made any speed
 improvements to the running time of  the tests.
 
 As far as I've noticed there is a policy to add the respective
 documentation for each addition to sage but no policy related to such tests.
 
 Am I correct? Is there any reason why this is not encouraged?
 
 Best,
 
 Jernej
 
 -- 
 You received this message because you are subscribed to the Google
 Groups sage-devel group.
 To post to this group, send email to sage-devel@googlegroups.com.
 To unsubscribe from this group, send email to
 sage-devel+unsubscr...@googlegroups.com.
 Visit this group at http://groups.google.com/group/sage-devel?hl=en.
  
  

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Re: Sage testing

2012-11-21 Thread Michael Orlitzky
On 11/21/2012 11:34 AM, P Purkayastha wrote:
 
 The policy is to add examples and tests within your documentation. Look 
 up the source code of some function like
 
 QQ??
 
 plot??
 
 integrate??
 
 and so on. You will find both examples and tests listed there.

And one thing that's easy to miss if you've never seen it before: all of
these examples and tests are checked automatically by the test suite. So
the tests are the documentation, and vice-versa.

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Sage-5.4 virtual appliance

2012-11-21 Thread mmarco
Which is the admin password?

And what happened with the idea of making a windows gui to handle the
VM?

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Combining finite/rational fields

2012-11-21 Thread Nils Bruin
On Nov 21, 5:15 am, Dima Pasechnik dimp...@gmail.com wrote:
 hmm, I don't think this example will fly. If you happen to have a
 divisior of p in the denominator then you get a point with every
 nonzero coordinate divisible by p. So the reduction of it is
 (0:0..:0) -- oeps --- a runtime error sowieso...

Not quite... the thing is, over Q, (1:p) and (1/p:1) represent the
same projective point. If we were to use coercion to reduce such
points modulo p, then (1:p) would nicely map to (1:0) in P^1(GF(p)),
but (1/p:1) would lead to an error.

I'm pretty sure sage enforces the normalization or the points {(1:p),
(p:1)} to either {(1:p),(1:1/p)} or {(1/p:1),(p:1)}, so you would
always run into the problem somewhere.

The real solution is (as sage does): There is no immediate natural
reduction concept for varieties defined over Q. You should first
choose a suitable model over Z. There is real mathematical content in
Sage not having such a coercion by default. It's not *just*
inconvenience.
Taking the inconvenience saves you from rather surprising and hard to
predict behaviour later on. If you put the coercion in here and then
fix reduction higher up the chain, you'll just keep stacking kludge
upon kludge.

---

GF(7)(4)*2/3  vs  2/3*GF(7)(4)

They may look the same, but thanks to / on ZZ changing parents, they
are not:

(GF(7)(4)*2)/3  vs  (2/3)*GF(7)(4)

One is a multiplication between QQ and GF(7); the other a division
between GF(7) and ZZ. By extending / on ZZ we've ruined
associativity! We should probably revert that then :-). We already
have // anyway. This example also shows how insidious a change in
behaviour for a basic operator can be. I definitely didn't think about
this one when / on ZZ was extended to produce elements in QQ.

That or we modify the python parses of expressions and let it do a
tree search to find which evaluation order produces an answer and
which one raises an error and go with the value... every time the
expression gets evaluated. But then we should probably rewrite sage in
Prolog to begin with.

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Sage-5.4 virtual appliance

2012-11-21 Thread Volker Braun
All passwords default to sage


On Wednesday, November 21, 2012 5:25:40 PM UTC, mmarco wrote:

 Which is the admin password? 

 And what happened with the idea of making a windows gui to handle the 
 VM? 


-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Re: Sage testing

2012-11-21 Thread Jernej Azarija
That is very neat!

Thanks for the info guys!

On Wednesday, 21 November 2012 18:12:27 UTC+1, Michael Orlitzky wrote:

 On 11/21/2012 11:34 AM, P Purkayastha wrote: 
  
  The policy is to add examples and tests within your documentation. Look 
  up the source code of some function like 
  
  QQ?? 
  
  plot?? 
  
  integrate?? 
  
  and so on. You will find both examples and tests listed there. 

 And one thing that's easy to miss if you've never seen it before: all of 
 these examples and tests are checked automatically by the test suite. So 
 the tests are the documentation, and vice-versa. 


-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




[sage-devel] Re: Error installing package lapack-20071123.p2

2012-11-21 Thread Amar Shah
Hi Andrea, Francois, and Jeroen.  Thanks for the advice.  It was really 
helpful.

I corrected LD_LIBRARY_PATH and reinstalled gfortran.  Resumed compiling.

Ran into another error, but I used a 'workaround' from here: 
https://groups.google.com/forum/?fromgroups=#!topic/sage-support/UJ9bz5PX-D0

I'll let you know how it turns out.  Thanks again.  Sorry I was so slow in 
getting back to you.

Amar



On Tuesday, October 16, 2012 6:44:31 PM UTC-4, Amar Shah wrote:

 Trying to build Sage 5.3 from source code on a Linux platform (Ubuntu 
 12.04, laptop with Intel Centrino Duo).

 Build halted with an Error installing package lapack-20071123.p2.

 For some reason (perhaps because my group membership is pending), I cannot 
 attach the relevant log file. Instead I am copy-pasting the text below. 
  Many apologies for this.

 Please let me know how I can assist you in resolving this problem.  Thanks 
 so much for helping.

 Error Log file: /spkg/logs/lapack-20071123.p2.log

 lapack-20071123.p2
 
 Extracting package 
 /home/amar/sage-5.3/spkg/standard/lapack-20071123.p2.spkg
 -rw-r--r-- 1 amar amar 3423099 Oct 12  2010 
 /home/amar/sage-5.3/spkg/standard/lapack-20071123.p2.spkg
 Finished extraction
 
 Host system:
 Linux amar-Satellite-A135 3.2.0-31-generic #50-Ubuntu SMP Fri Sep 7 
 16:17:36 UTC 2012 i686 i686 i386 GNU/Linux
 
 C compiler: gcc
 C compiler version:
 Using built-in specs.
 COLLECT_GCC=gcc
 COLLECT_LTO_WRAPPER=/usr/lib/gcc/i686-linux-gnu/4.6/lto-wrapper
 Target: i686-linux-gnu
 Configured with: ../src/configure -v --with-pkgversion='Ubuntu/Linaro 
 4.6.3-1ubuntu5' --with-bugurl=file:///usr/share/doc/gcc-4.6/README.Bugs 
 --enable-languages=c,c++,fortran,objc,obj-c++ --prefix=/usr 
 --program-suffix=-4.6 --enable-shared --enable-linker-build-id 
 --with-system-zlib --libexecdir=/usr/lib --without-included-gettext 
 --enable-threads=posix --with-gxx-include-dir=/usr/include/c++/4.6 
 --libdir=/usr/lib --enable-nls --with-sysroot=/ --enable-clocale=gnu 
 --enable-libstdcxx-debug --enable-libstdcxx-time=yes 
 --enable-gnu-unique-object --enable-plugin --enable-objc-gc 
 --enable-targets=all --disable-werror --with-arch-32=i686 
 --with-tune=generic --enable-checking=release --build=i686-linux-gnu 
 --host=i686-linux-gnu --target=i686-linux-gnu
 Thread model: posix
 gcc version 4.6.3 (Ubuntu/Linaro 4.6.3-1ubuntu5) 
 
 make[2]: Entering directory 
 `/home/amar/sage-5.3/spkg/build/lapack-20071123.p2/src'
 ( cd INSTALL; make; ./testlsame; ./testslamch; \
   ./testdlamch; ./testsecond; ./testdsecnd; ./testversion )
 make[3]: Entering directory 
 `/home/amar/sage-5.3/spkg/build/lapack-20071123.p2/src/INSTALL'
 sage_fortran -fPIC  -c lsame.f -o lsame.o
 sage_fortran -fPIC  -c lsametst.f -o lsametst.o
 sage_fortran  -o testlsame lsame.o lsametst.o
 sage_fortran -fPIC  -c slamch.f -o slamch.o
 sage_fortran -fPIC  -c slamchtst.f -o slamchtst.o
 sage_fortran  -o testslamch slamch.o lsame.o slamchtst.o
 sage_fortran -fPIC  -c dlamch.f -o dlamch.o
 sage_fortran -fPIC  -c dlamchtst.f -o dlamchtst.o
 sage_fortran  -o testdlamch dlamch.o lsame.o dlamchtst.o
 sage_fortran -fPIC  -c second_INT_CPU_TIME.f -o second_INT_CPU_TIME.o
 sage_fortran -fPIC  -c secondtst.f -o secondtst.o
 [INFO] : TIMER value: INT_CPU_TIME (given by make.inc)
 sage_fortran  -o testsecond second_INT_CPU_TIME.o secondtst.o
 sage_fortran -fPIC  -c dsecnd_INT_CPU_TIME.f -o dsecnd_INT_CPU_TIME.o
 sage_fortran -fPIC  -c dsecndtst.f -o dsecndtst.o
 [INFO] : TIMER value: INT_CPU_TIME (given by make.inc)
 sage_fortran  -o testdsecnd dsecnd_INT_CPU_TIME.o dsecndtst.o
 sage_fortran -fPIC  -c tstiee.f -o tstiee.o
 sage_fortran  -o testieee tstiee.o
 sage_fortran -fPIC  -c ilaver.f -o ilaver.o
 sage_fortran -fPIC  -c LAPACK_version.f -o LAPACK_version.o
 sage_fortran  -o testversion ilaver.o LAPACK_version.o
 make[3]: Leaving directory 
 `/home/amar/sage-5.3/spkg/build/lapack-20071123.p2/src/INSTALL'
 ./testlsame: /home/amar/lingo13/bin/linux32/libgfortran.so.3: version 
 `GFORTRAN_1.4' not found (required by ./testlsame)
 ./testslamch: /home/amar/lingo13/bin/linux32/libgfortran.so.3: version 
 `GFORTRAN_1.4' not found (required by ./testslamch)
 ./testdlamch: /home/amar/lingo13/bin/linux32/libgfortran.so.3: version 
 `GFORTRAN_1.4' not found (required by ./testdlamch)
 ./testsecond: /home/amar/lingo13/bin/linux32/libgfortran.so.3: version 
 `GFORTRAN_1.4' not found (required by ./testsecond)
 ./testdsecnd: /home/amar/lingo13/bin/linux32/libgfortran.so.3: version 
 `GFORTRAN_1.4' not found (required by ./testdsecnd)
 ./testversion: /home/amar/lingo13/bin/linux32/libgfortran.so.3: version 
 `GFORTRAN_1.4' not found (required by ./testversion)
 make[2]: *** [lapack_install] Error 1
 make[2]: Leaving directory 
 

[sage-devel] Re: Sage Days in Bobo-Dioulasso debriefing; Sage in developping countries

2012-11-21 Thread Nicolas M. Thiery
On Tue, Nov 20, 2012 at 12:07:50AM -0800, tom d wrote:
Thanks for running this, Nicolas, and providing the detailed report!

Well, for the running all the kudos should really go to the
organizers. And all those who helped for the Sage sessions. All I had
to do was to teach Sage to *motivated* students (ok, and fight some
technical details); other than this it was vacations: lodging and food
was provided. And entertainment as well with my fellow's classes!

Congrats on all your ongoing work in Kenya! If I was not already going
to be away from home for quite some time this Spring, I would have
jumped on the occasion to come help for the workshop.

Cheers,
Nicolas
--
Nicolas M. Thiéry Isil nthi...@users.sf.net
http://Nicolas.Thiery.name/

-- 
You received this message because you are subscribed to the Google Groups 
sage-devel group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.




Re: [sage-devel] Ubuntu 12.04: Sage fails to install from PPA - Error installing package gap_packages-4.4.12.p

2012-11-21 Thread Jan Groenewald
Hi Johannes,

I suggest removing sagemath-optional, with this command
sudo apt-get purge sagemath-optional

Regards,
Jan


On 21 November 2012 18:32, Johannes dajo.m...@web.de wrote:

 Hi

 Am Mo 19 Nov 2012 04:47:19 CET schrieb Jan Groenewald:

  dpkg-reconfigure sagemath-optional
 that does not work:
 /usr/sbin/dpkg-reconfigure: sagemath-optional ist kaputt oder nicht
 komplett installiert
 (package is defect or not completely installed)
 if I try
 dpkg-reconfigure --force sagemath-optional
 I get get exactly the same error as before.

 greatz Johannes

  Until you do this your package manager will stay in a broken state.
  When you run dpkg -l sagemath-optional, it should also say ii
  next to it, once you are finished.
 
  Regards,
  Jan
 
 
 
  On 18 November 2012 21:42, Johannes dajo.m...@web.de
  mailto:dajo.m...@web.de wrote:
 
  Hey,
  On 18.11.2012 20:23, Jan Groenewald wrote:
   Dear Johannes,
  
   How did you install? From the PPA? Is this the sagemath-optional
  trying
   to build?
 
  I once installed Sage by `apt-get install sagemath-optional
  sagemath-upstream-binary`
 
  
   Johannes, please list the installed PPA packages:
   dpkg -l |grep sagemath
 
  dpkg -l |grep sagemath
  iF  sagemath-optional   5.4
  ii  sagemath-upstream-binary5.4ubuntu1
 
 
   sudo apt-get update
   sudo apt-get dist-upgrade
   sudo sage -f
  /usr/lib/sagemath/spkg/optional/gap_packages-4.4.12.p1.spkg
 
  Installing the package by `sage -f ..` as above seems to work fine.
 
  greatz
  Johannes
 
   Regards,
   Jan
  
  
  
   On 18 November 2012 21:04, Johannes dajo.m...@web.de
  mailto:dajo.m...@web.de
   mailto:dajo.m...@web.de mailto:dajo.m...@web.de wrote:
  
   Hi list,
   I tried to upgrade my sage installation, but it fails to build:
  
   make[1]: Betrete Verzeichnis
   '/usr/lib/sagemath/local/lib/pkg/grape/nauty22'
   gcc -c -O4 -march=i686  -DBIGNAUTY -o naututilB.o naututil.c
   gcc -c -O4 -march=i686  -DBIGNAUTY -o nautyB.o nauty.c
   gcc -c -O4 -march=i686  -DBIGNAUTY -o nautilB.o nautil.c
   gcc -c -O4 -march=i686  -DBIGNAUTY -o nautinvB.o nautinv.c
   gcc -c -O4 -march=i686  -DBIGNAUTY -o naugraphB.o naugraph.c
   gcc -c -O4 -march=i686  rng.c
   gcc -o dreadnautB -O4 -march=i686 -DBIGNAUTY dreadnaut.c
  naututilB.o \
   nautyB.o nautilB.o nautinvB.o naugraphB.o rng.o
   make[1]: Verlasse Verzeichnis
   '/usr/lib/sagemath/local/lib/pkg/grape/nauty22'
   ( cd src; make BINDIR= )
   make[1]: Betrete Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/grape/src'
   gcc -O -o ../bin//drcanon4  drcanon4.c
   gcc -O -o ../bin//drtogap4  drtogap4.c
   gcc -O -o ../bin//gap4todr  gap4todr.c
   make[1]: Verlasse Verzeichnis
   '/usr/lib/sagemath/local/lib/pkg/grape/src'
   cat: ../..//sysinfo.gap: Datei oder Verzeichnis nicht gefunden
   ( test -d bin || mkdir bin; \
   test -d bin/ || mkdir bin/; cd bin/; \
   make -f ../../Makefile all2 CC=gcc CFLAGS=-O2; \
   cd ../../src/leon/src/../; ./configure; make; mkdir
   ../../bin/leon; \
   cp cent ../../bin/leon; cp cjrndper ../../bin/leon; \
   cp commut ../../bin/leon; cp compgrp ../../bin/leon; \
   cp desauto ../../bin/leon; cp fndelt ../../bin/leon; \
   cp generate ../../bin/leon; cp inter ../../bin/leon; \
   cp orbdes ../../bin/leon; cp orblist ../../bin/leon; \
   cp randobj ../../bin/leon; cp setstab ../../bin/leon; \
   cp wtdist ../../bin/leon; cp src/*.sh ../../bin/leon; \
   cp wtdist ../../bin; cp desauto ../../bin; \
   cp wtdist ../../bin/; cp desauto ../../bin/ \
   )
   make[1]: Betrete Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/guava/bin'
   make[1]: ../../Makefile: Datei oder Verzeichnis nicht gefunden
   make[1]: *** Keine Regel, um »../../Makefile« zu erstellen.
   Schluss.
   make[1]: Verlasse Verzeichnis
   '/usr/lib/sagemath/local/lib/pkg/guava/bin'
   /bin/sh: 4: cd: can't cd to ../../src/leon/src/../
   /bin/sh: 4: ./configure: not found
   make[1]: Betrete Verzeichnis
  '/usr/lib/sagemath/local/lib/pkg/guava/bin'
   make[1]: *** Keine Targets angegeben und keine
  »make«-Steuerdatei
   gefunden.  Schluss.
   make[1]: Verlasse Verzeichnis
   '/usr/lib/sagemath/local/lib/pkg/guava/bin'
   mkdir: kann Verzeichnis »../../bin/leon“ nicht anlegen:
  Datei oder
   Verzeichnis nicht gefunden
  
   my setup:
   Ubuntu 12.04
   Linux