On 2013-04-17, Tom Boothby tomas.boot...@gmail.com wrote:
Dima,
Rows correspond to vertices and columns correspond to edges. This
matrix represents an undirected triangle with a double edge. I don't
understand why the graph __init__ requires a +1 and a -1 in each
column -- that describes a
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 19.04.2013 21:23, LRN wrote:
On 19.04.2013 20:01, Dan Drake wrote:
On Fri, 19 Apr 2013 at 05:47AM -0700, LRN wrote:
Eventually i ended up setting up Debian in a VM, installing
Sage, texlive, TeXWorks, and hooking it up to SageTeX. I have
a
On 2013-04-19, Simon King simon.k...@uni-jena.de wrote:
Hi Johannes,
On 2013-04-18, Johannes dajo.m...@web.de wrote:
Hi guys,
I have the following setting: Given a finite subgroup G of GL_\C(n) of
order k, acting on C[x_1,...,x_n] by multiplication with (potenz of a )
k-th root of unity.
I'll just ask TeXWorks people directly. I doubt i'm the first guy
with this problem, they should have figured out something by now.
In a worst-case scenario i can just hack the functionality in
myself.
Ok, i've got it to work in a more-or-less satisfactory manner. See my
reply
Dear all,
Gordon Royle has the following issue. Any ideas?
--Stefan van Zwam.
Begin forwarded message:
Subject: [sage-matroid] Memory
Date: April 22, 2013 2:24:05 AM EDT
To: sage-matr...@googlegroups.com
Reply-To: sage-matr...@googlegroups.com
I'm trying to work with some collections of
On 2013-04-22, Stefan van Zwam stefanvanz...@gmail.com wrote:
--Apple-Mail=_74BC8403-8943-4A42-AB16-3A3033AB1299
Content-Type: text/plain; charset=ISO-8859-1
Dear all,
Gordon Royle has the following issue. Any ideas?
a memory leak?
--Stefan van Zwam.
Begin forwarded message:
Subject:
On Mon, 22 Apr 2013 at 05:55AM -0700, kcrisman wrote:
Dan, this seems like it might be a useful thing to include with SageTeX,
unless TeXWorks is planning on including this in an update. It's just a
shell script, and could be put in an appropriate directory along with
updated Sage
yea, that's nearly what I am looking for. Is it possible to consider a
weighted group action too?
e.g. If \xi is of order n and \xi a n-th root of unity.
g (p_1,\dots, p_n) \to (\xi^a_1 p1 , dots, \xi^a_n p_n)?
s.t. \sum a_i = n?
bg,
Johannes
On 19.04.2013 17:53, Simon King wrote:
Hi Johannes,
Yes it does, in a way. If you want to construct the Laplacian matrix L of the
graph from the incidence matrix E just by using matrix multiplication,
you need to pick up an orientation for each edge, i.e. assigning +1 to
one end, and -1 to the other. Then, bingo, you have L=E.T*E
I've always
The first question is, are you actually running out of ram? The garbage
collector seems to have triggered full collections at the 4gb mark, and
memory fragmentation might have left you with 900mb of address space that
is mainly empty. Also, do you really need all 4 million graphs in memory
That might not have been terribly clear -- the point is, incidence
of edges and vertices is a binary relation. One needs to make a
choice to orient the matrix to make the linear algebra coincidence
work out.
On Mon, Apr 22, 2013 at 8:51 AM, Tom Boothby tomas.boot...@gmail.com wrote:
Yes it
To work around this, I tried storing only sparse6_strings. The
original code failed (just appending the same graph 100k times), and
the following worked on my machine. If more list functionality is
necessary, I'd be happy to provide.
There will be some slowdown in creating the graphs extra
12 matches
Mail list logo
