FYI
I submitted a bug report [ http://directory.fsf.org/wiki/Review:Sage-BUG-1 ]
because the directory entry [ http://directory.fsf.org/wiki/Sage ] was a
tad out-of-date.
The blurb is lifted from bits of text on the Sage website. Feel free to
suggest further changes.
Regards
Anthony David
--
T
How does one see which backend gets invoked for, say,
sage.functions.other.gamma1(float(6)), without reading the corresponding
source? With the latter, I must say it's hidden somewhere in coersion code,
and I can't dig it up quickly :–(
--
To post to this group, send an email to sage-dev
For me, alpha5 built OK on an ARM box running 11.10.
(it needed a couple of ARM-specific fixes, but otherwise was just fine).
It does not have readline-dev installed, which probably explains why I had
not R-related
problems.
Should one expect any regressions with alpha6?
Dima
--
To post to thi
On Friday, 6 January 2012 22:57:24 UTC+8, David Joyner wrote:
>
> On Fri, Jan 6, 2012 at 9:43 AM, Jason Grout
> wrote:
> > Hi all,
> >
> > Is there an easy way to ask if two graphs are isomorphic, respecting some
> > coloring or labeling of the vertices? I see the is_isomorphic function
> let
Attach a loop to every vertex and colour these loops appropriately (a loop
is an edge – otherwise it's a bug, IMHO).
This gives you an edge colouring.
--
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...@g
Hi Sage-devel,
Here are pictures from JMM 2012. Many are at the Sage booth...
http://www.facebook.com/media/set/?set=a.10150486010783682.386745.504538681&type=1&l=1376aa6952
-- William
--
William Stein
Professor of Mathematics
University of Washington
http://wstein.org
--
To post to th
Hi
Are closures permanently broken in sage-4.8's cython, or was it a
passing fashion? When I use something like this in a pyx file:
cpdef test():
a = [1,2,3,4]
if any(b < 0 for b in a): print "yes"
else: print "no"
return
I get this error:
_Users_user_common_Research_SAGE_p
This is yet another one of those cases where setting LD_LIBRARY_PATH bites
us. We compiled our own PPL library, but gcc requires a slightly different
version. A workaround is to delete $SAGE_LOCAL/lib/libppl.* and then run
make again.
--
To post to this group, send an email to sage-devel@goog
Hi all,
I'm trying to build sage from source on my lap top and am having
trouble. According to the install log it can't install pycrypto and
suggested I either go here for help or try and debug it myself. I'm
still learning bash and didn't think it would be a good idea to try
the latter.
More det
On 1/6/12 11:32 AM, javier wrote:
Hi there,
Some small issues I noticed working with the notebook (using sage
4.7.2 on Mac OS-X 10.6.8):
1. Using SHIFT+Click to enter plain text does not seem to work in
Firefox (using either Firefox 9 or 10 or whatever got pushed this
morning). It does work in
Hi there,
Some small issues I noticed working with the notebook (using sage
4.7.2 on Mac OS-X 10.6.8):
1. Using SHIFT+Click to enter plain text does not seem to work in
Firefox (using either Firefox 9 or 10 or whatever got pushed this
morning). It does work in Chrome, Safari and Opera.
2. When u
I had this problem a few weeks ago. Sage is already set up to check
isomorphism of edge-labeled graphs, but I needed vertex-labeled graphs. It
turns out that Robert Miller also implemented vertex-labeled isomorphism
testing but it is not exposed in the is_isomorphic() method. But if you are
wil
Jason,
I've been working with nonisomorphic colorings recently. I use the following:
def canonical_coloring_label(G,c):
"""
Given a coloring dictionary,
{color1 : [u1, u2, ...], color2 : [v1, v2, ... ], ... }
return a string which uniquely identifies the isomorph
And if you accept to sligthly change the graph, you can add a universal
vertex v to it. If u is of color red, color edge uv with red, and the same
for all vertices. Do this in both graph and all will be fine :-)
Nathann
--
To post to this group, send an email to sage-devel@googlegroups.com
To
On Fri, Jan 6, 2012 at 10:09 AM, John Cremona wrote:
> On 6 January 2012 15:04, David Joyner wrote:
>> On Thu, Jan 5, 2012 at 9:35 AM, Jeroen Demeyer
>> wrote:
>>> For those running Ubuntu 11.10 (Oneiric Ocelot):
>>>
>>> Please test sage-4.8.alpha6:
>>> http://boxen.math.washington.edu/home/rel
On 6 January 2012 15:04, David Joyner wrote:
> On Thu, Jan 5, 2012 at 9:35 AM, Jeroen Demeyer wrote:
>> For those running Ubuntu 11.10 (Oneiric Ocelot):
>>
>> Please test sage-4.8.alpha6:
>> http://boxen.math.washington.edu/home/release/sage-4.8.alpha6/sage-4.8.alpha6.tar
>
>
> Build went fine an
On Thu, Jan 5, 2012 at 9:35 AM, Jeroen Demeyer wrote:
> For those running Ubuntu 11.10 (Oneiric Ocelot):
>
> Please test sage-4.8.alpha6:
> http://boxen.math.washington.edu/home/release/sage-4.8.alpha6/sage-4.8.alpha6.tar
Build went fine and all tests passes on sage -testall.
>
> In some cases
On Fri, Jan 6, 2012 at 9:43 AM, Jason Grout wrote:
> Hi all,
>
> Is there an easy way to ask if two graphs are isomorphic, respecting some
> coloring or labeling of the vertices? I see the is_isomorphic function lets
I don't know if this is easy or not but here is an idea:
First, suppose you ha
Hi all,
Is there an easy way to ask if two graphs are isomorphic, respecting
some coloring or labeling of the vertices? I see the is_isomorphic
function lets you respect edge labels, so I guess I could attach a new
vertex to, say, all "blue" vertices, and label each of the edges to this
new
I noticed that sagenb.org wasn't responding, so I restarted it. If you
are at the Sage booth and sagenb.org is not working, please send a
message here so that someone can give it a kick (unless, of course,
there is someone at the booth that can restart it right away).
Thanks,
Jason
--
To po
20 matches
Mail list logo
