Hi,
I am looking for a way to define 1) finite (multiplicative) semigroups
generated by a set of square 0/1 matrices where the composition is the
reduced matrix multiplication (reduce the product of two 0/1 matrices
by putting a 1 whenever the result is positive and a 0 otherwise) or
more generall
Even stranger: The same happens for Graph as well.
It seems constructing an empty graph or digraph with
G=Graph(multiple_edges=True)
or
G=Graph([],multiple_edges=True)
does not set the property of being a multi-graph.
E.g. doing
G
afterwards gives the information
Graph on 0 vertices
inste
Hi,
I encountered a strange behaviour of the add_edges method for DiGraphs
(using SAGE 4.5.1). Perhaps this is intended behaviour, but as it
seems quiet odd to me I would like to hear the opinion of more
experienced (di)graph-users. Maybe this is a real bug...
If I define a looped, multi-edge emp
Yes, using the coercion, everything works fine. Thanks a lot for your
help.
Nevertheless the commands are much slower than using just the
polynomial ring and modding out afterwards. For a bigger example, I
get 340 seconds for iterating with the quotient_ring methods whereas
it takes less than 10 s
Hi SAGE developers,
I have a question regarding quotient fields of polynomial rings. I
want to iterate a polynomial in two variables over a finite field and
need to mod out higher powers. So I defined a finite field, a
polynomial ring, a quotient ring and a polynomial in it:
F.=FiniteField(5)
R.=
Hi sage-devel team,
I have a question concerning the definition of new rings in SAGE.
I would like to generate matrices whose elements are finite formal
sums of words (i.e. linear combinations with integer coeffs of
elements of a free monoid over some finite alphabet).
I was able to get this far
