I get the same error with the latest Sage, downloaded for MacOSX from the
website.
Is this still the way to go? I really want to use Python 3 though. How can
I enable that?
Best,
Albert
On Friday, November 11, 2016 at 11:30:14 PM UTC+1, Eden Harder wrote:
>
> Thank you all! It works!
s()[1,1]
> sage: x = h10 + 3/2 * h11
> sage: x.to_cycle() # a representative of x as a linear combination of
> chains
> (0, 1) + 3/2*(0, 2) - (0, 3) - 3/2*(0, 5) + (1, 3) + 3/2*(2, 5)
>
> --
> John
>
> On Friday, September 9, 2016 at 8:28:31 AM UTC-7, Albert Haase wrote:
&
For an abstract finite simplicial complex C, the method
homology(algorithm='auto',generators=True) uses CHomP to compute the
homology groups and their generators. The generators are conveniently
expressed as sums of simplices from C rather than as coefficient vectors of
chains from the chain co
***
IPython post-mortem report
{'codename': 'An Afternoon Hack',
'commit_hash': '2b1d88b',
'commit_source': 'installation',
'default_encoding': 'UTF-8',
'ipython_path': '/Applications/sage/local/lib/python2.7/site-package
I forgot to mention that I'm using a server hosted at sagenb.org. The
version reported there is 5.11. At my end, I'm using the latest firefox on
a 64 bit Ubuntu 12.04(LTS) OS.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe fr
This morning I figured out how to plot the modulus of a complex function in
sage. In my travails I wondered why the first snippet works, but the
second does not? Is there any easy way to make the second snippet work?
#Plot the modulus of the function, works
var('z',domain=CC)
var('x y', domain
e in the submatrix. That takes away in certain
circumstances a lot more work from the user. And it is not very
complicated to implement.
Tell me what you think,
Best,
Albert
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+
Well,
this would explain it and gives the correct output. Now my other
question: Why is this implemented like this? A minimum spanning tree
does not make sense in a not weighted Graph and as far as I read the
documentation, "Is G weighted" is part of the sanity checks that is
performed in the krus
on a machine where gcc is v4.1.2 (RHEL5).
Albert
Original Message
Subject: installation failing at 'ratpoints'
Date: Tue, 26 Jan 2010 14:33:27 -0600
From: Albert Everett
Reply-To: aeever...@ualr.edu
Organization: UALR GIT
To: sage-support@googlegroups.com
Using gcc4 a
Using gcc4 and g++4, e.g.
# cd sage-4.3.1
# CC=gcc4 CXX=g++4 make
...
Finished installing ecm-6.2.1.p1.spkg
sage-spkg ratpoints-2.1.3 2>&1
Warning: Attempted to overwrite SAGE_ROOT environment variable
ratpoints-2.1.3
Machine:
Linux ares.ualr.edu 2.6.9-89.0.19.ELsmp #1 SMP Wed Dec 30 12:52:55 E
10 matches
Mail list logo
