If you want to play with digraphs attached is program for generating
digraph diregular cages of any girth and degree.
On Wed, Oct 31, 2012 at 10:53:56AM +0100, Nathann Cohen wrote:
Some benchmarks on moderate cages (4324 vertices, girth 19) suggest i
probably will lose if you implement it
Hello,
I try to execute one of the examples for computing the variety of a system of
Boolean polynomials from the Sage reference manual:
http://www.sagemath.org/doc/reference/sage/rings/polynomial/pbori.html
and I get the error:
AttributeError: 'sage.rings.polynomial.pbori.BooleanPolynomial'
On Wednesday, October 31, 2012 9:39:11 AM UTC-7, V wrote:
Hello,
I try to execute one of the examples for computing the variety of a system
of Boolean polynomials from the Sage reference manual:
http://www.sagemath.org/doc/reference/sage/rings/polynomial/pbori.html
and I get the
Thank you for the quick reply! I tried to compile Sage-5.3 from source and
I get an error related to gcc-4.6.3:
In file included from /usr/include/features.h:378:0,
from /usr/include/stdio.h:28,
from ../../../src/libgcc/../gcc/tsystem.h:87,
from
Sorry, I was not able to attach the full log file gcc-4.6.3.log. Please
find below the most relevant parts of it.
...
checking whether the target assembler supports thread-local storage... yes
checking whether the thread-local storage support is from emutls... yes
configure: updating cache
please see
this https://groups.google.com/d/topic/cvxopt/xQ-lR9ESijg/discussion
far a way to make it more sane. It turns out that cvxopt has un
undocumented function to
extract the Cholesky factor directly.
On Tuesday, 30 October 2012 21:49:48 UTC+8, Dima Pasechnik wrote:
On 2012-10-29,
On 2012-10-31, V vesselin.velich...@gmail.com wrote:
--=_Part_281_17041689.1351705746629
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Sorry, I was not able to attach the full log file gcc-4.6.3.log. Please=20
find below the most relevant parts
Ahahaaha. Well, I wrote what I thought would be a good if hard to read
implementation, and it turns out to be... slower O_O
I still do not really understand why, except that copying the graph takes
time, too. For some reason.
The code is slower in interesting case, and faster in stupid cases :
Hi,
after a discussion
here: https://groups.google.com/d/topic/cvxopt/xQ-lR9ESijg/discussion
it turns out that there is enough CHOLMOD interface already in Sage, it's
just not documented properly.
Should I volunteer to get sparse Cholesky implemented for non-exact sparse
Sage matrices, via
On 10/31/12 11:53 PM, Dima Pasechnik wrote:
Should I volunteer
+1. Always +1 to that question. :)
Jason
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from
10 matches
Mail list logo
