Hi!
In order to create a right module over a path algebra P, with a vector space
basis given by the potentially infinite family of paths starting at some
vertex, I thought I'd start with CombinatorialFreeModule.
My expectation was that it would work *easily* and out of the box, if
- one provides
IMHO its a stupid firewall setup to restrict by IP numbers. It reeks of
the 90s where you neither had github nor cdns. But its 20 years later, if
you can't connect to github then you can't do scientific computing work
period. Just tell your admins to get a clue, thats way more productive
Hi Travis,
On 2015-06-19, Travis Scrimshaw tsc...@ucdavis.edu wrote:
Hey Simon,
That is correct and the only way I know of AFAIK.
Thank you!
Cheers,
Simon
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from this
On Fri, Jun 19, 2015 at 09:31:21PM +, Simon King wrote:
Hi!
Let D be a digraph, potentially with multiple edges and loops. Let v be
a vertex.
How should one test whether v is contained in a cycle (including loops)?
Is it correct that v is in a cycle or loop if and only if
Hi Nicolas,
On 2015-06-20, Nicolas M. Thiery nicolas.thi...@u-psud.fr wrote:
- search for a path from one of the out neighbors of v to v
Sure, but how? In fact I was looking for a method of digraphs telling me
whether there is a path from vertex v to vertex w, but I couldn't find
one.
w in
On Friday, June 19, 2015 at 5:29:42 PM UTC-7, David Roe wrote:
Another option might be to force certain construction paths to use keyword
arguments. For example,
matrix(4,4,scalar = x+y)
matrix(4,4,iterator = x+y)
David
Indeed, but then: how is this more convenient than the following?
On Sun, 14 Jun 2015, Nathann Cohen wrote:
something like the following to work, you will have to mess with this
category (or replace it by another object)
sage: for p in Posets(max_width=3,max_height=4,num_points=90):
: do_something
I think that this can be done. But what about
On Saturday, June 20, 2015 at 9:15:06 AM UTC-7, Martin R wrote:
I don't understand this. I just traced matrix(2,2,x) and this is handled
by _matrix_constructor. I don't see why matrix(2,2,x) needs to return a
diagonal matrix. Could you please explain what you mean with
matrix(n,n,c) is
The problem with matrix(n,n,c) is that it's actually coming from matrix
rings! Scalars should probably coerce in there to make A - 1 work. It's
something supported on a level below.
I don't understand this. I just traced matrix(2,2,x) and this is handled
by _matrix_constructor. I don't
PS:
I think it would be nice if CombinatorialFreeModule.Element would
actually use Sage's coercion framework.
Is there a ticket to make CombinatorialFreeModule.Element a Cython class
using the infrastructure that is provided by
sage.structure.element.ModuleElement?
Best regards,
Simon
--
You
Am Samstag, 20. Juni 2015 18:44:30 UTC+2 schrieb Nils Bruin:
On Saturday, June 20, 2015 at 9:15:06 AM UTC-7, Martin R wrote:
I don't understand this. I just traced matrix(2,2,x) and this is handled
by _matrix_constructor. I don't see why matrix(2,2,x) needs to return a
diagonal matrix.
We propose a new C++ package implementing the F4 algorithm.
We open this post in order to make it standard if the community agree.
For the moment the package has not been tested on all the supported
distributions.
The related ticket is http://trac.sagemath.org/ticket/18749
On Sat, Jun 20, 2015 at 11:01 AM, Titouan COLADON
titouan.cola...@gmail.com wrote:
We propose a new C++ package implementing the F4 algorithm.
We open this post in order to make it standard if the community agree.
To clarify, I think these are the options for this vote:
[ ] Yes, make
On Saturday 20 Jun 2015 11:10:21 William Stein wrote:
On Sat, Jun 20, 2015 at 11:01 AM, Titouan COLADON
titouan.cola...@gmail.com wrote:
We propose a new C++ package implementing the F4 algorithm.
We open this post in order to make it standard if the community agree.
To clarify, I
I vote for the obvious Let's make it optional first and see how it goes.
Turning it into a standard package later is a one-line change anyway.
http://doc.sagemath.org/html/en/developer/packaging.html#prerequisites-for-new-standard-packages
Nathann
--
You received this message because you are
On Saturday, June 20, 2015 at 3:34:06 PM UTC-7, Martin R wrote:
What is the bug here? Do you think matrix(2,3,1) should succeed? Do you
think it should produce a different error message?
No, I think that matrix(nrows, ncols, element) sould fail, unless element
is callable or iterable.
2015-06-21 0:21 GMT-03:00 Francois Bissey francois.bis...@canterbury.ac.nz:
There are two factors here:
1) libcsage is gone in the upcoming sage 6.8.
Ok. I would prefer it kept around as a generic place to add
wrappers, or better saying hacks :)
2) I bit the bullet and used the pari git
There are two factors here:
1) libcsage is gone in the upcoming sage 6.8.
2) I bit the bullet and used the pari git snapshot used in sage
for sage-on-gentoo.
This was not a light decision. I looked at the packages depending
of pari and I found they were in two class:
a) packages using an outdated
On 20/06/15 23:21, Nils Bruin wrote:
On Saturday, June 20, 2015 at 11:55:02 AM UTC-7, Martin R wrote:
Yes, that's quite clear. _matrix_constructor determines nrows (2) and
ncols (3) and the ring (Symbolic Ring) and calls
matrix_space.MatrixSpace(ring, nrows, ncols)(entries). This fails,
You can certainly have an unsigned infinity that is not complex.
If you have signed zeros, then
1/(-0) is negative infinity
1/(+0) is positive infinity
1/(0) is unsigned.
Or as previously stated you can think of the unsigned infinity as a
completion under division of the real line in some
On Saturday, June 20, 2015 at 11:55:02 AM UTC-7, Martin R wrote:
Yes, that's quite clear. _matrix_constructor determines nrows (2) and
ncols (3) and the ring (Symbolic Ring) and calls
matrix_space.MatrixSpace(ring, nrows, ncols)(entries). This fails, since
entries is a single element.
Am Samstag, 20. Juni 2015 23:21:21 UTC+2 schrieb Nils Bruin:
On Saturday, June 20, 2015 at 11:55:02 AM UTC-7, Martin R wrote:
Yes, that's quite clear. _matrix_constructor determines nrows (2) and
ncols (3) and the ring (Symbolic Ring) and calls
matrix_space.MatrixSpace(ring, nrows,
Hi,
I believe this should be one of the best places to ask,
about any estimative of when it will be available.
I have sagemath 6.5 packaged in Fedora. Today I started
implementing a pari_wrap.c and pari_wrap.h interface
in libcsage, but noticed it would not be a trivial patch to
create
23 matches
Mail list logo
