>
> An unenlightened taxpayer actually might prefer this scheme, as currently
> most of Sagemath development is funded by taxpayers, and they might not see
> much
> value in it.
>
Other taxpayers (possibly french) could tell you that their government has
invested millions of euros in this
>
> No, you are just not seeing the obvious here.
> William views SMC as a part of activities associated to Sagemath
> development, and it's hard to argue against this point of view.
>
It's true, it is "associated". One important side of SageMath-the-software
is that it is "led' by a
The *very* least you can do if you answer my messages publicly is to
let them appear on the forum.
On 24 August 2016 at 22:12, Nathann Cohen <nathann.co...@gmail.com> wrote:
> Quote from William Stein, CEO of SageMath Inc (private for-profit
> Delaware company) [1
>
> Nathan does give the link to the original post, but he is quoting out of
> context. Here is the full post:
>
Still, it would be incomplete to claim, as in the original post, that the
only aim of SageMath Inc. is to fund Sage development and associated
activities. Take it as a proof that
Quote from William Stein, CEO of SageMath Inc (private for-profit
Delaware company) [1]
So there is no confusion, my top priority right now is to **make a lot
of money** by building a profitable company on open source software
(Latex, Linux, Sage, Octave, R, etc.)
(full post)
If you are just wondering how to change the viewer used to display the
pictures produced by Sage, the answer is right there:
http://doc.sagemath.org/html/en/reference/misc/sage/misc/viewer.html
Nathann
On Saturday, February 6, 2016 at 11:11:57 PM UTC+1, jmarcell...@ufpi.edu.br
wrote:
>
>
>
> there is subgraph_search_iterator()
> which might not be optimized for cycles too much, but does the job, I
> guess:
>
+1. That's the easiest way to get them. If performance is a problem you may
want to work a bit more on the exploration algorithm, but if you do so do
not overestimate
>
> contributions. E.g., they won't even consider a new component be
> added to Python unless somebody clearly commits to supporting the
> contribution for "five years". And of course the people making that
> commitment have to be reputable.We should do the same for Sage --
>
Don't
> Hey I was just reporting on a conversation with Guido about what they
> *already* do with Python.
It ended with "we should do the same in Sage"
> Huge +1. I'm all for Sage devs contributing upstream :-)
Are you one of them?
Nathann
--
You received this message because you are subscribed
>> Are you one of them?
>
> Rolls eyes...
I can't help but notice that you say "we" when you say what should be
done, and you say "you" when there is actual work ahead.
You reported this problem concerning cliquer, and you are "all for
Sage developpers contributing upstream". Will you help?
Or
> Wouldn't be possible to make a cliquer package ?
There is one already, installed in Sage by default.
This package is a copy of the cliquer tarball that you can download
from its official website. It contains a 'minimal' build system, which
does not work on all platforms that Sage supports. For
> Nathann:
William,
I'm sorry to say that the situation is not as simple as "You suggest,
and you are happy to see people doing it for you".
Sometimes, people do stuff because nobody would do it otherwise. They
feel responsible as members of the community, and so give it a try. I
swear: trust
>
> Is it possible to use a plot of some object as a subfigure in given
> position?
>
> Suppose for example that g is a graph. What if I want to plot g, an arrow,
> and g with some edge deleted? There is graphic_array, but it is not quite
> flexible. I would like to have something like
>
If
Just completing the answers here, in case somebody needs it:
'view(g)' has a different behaviour in Sage and in SMC. In Sage it uses
LaTeX, while in SMC it is more or less equivalent to g.show(method='js')
(which relies on javascript/d3js, hence no latex whatsoever).
Currently, there is no way
>
> P.S.: I checked the docs and couldn't find anything but this thread. On
> the other hand, I cannot believe that such a basic thing hasn't been
> implemented after many years.
>
Maybe those who need it are all waiting for "somebody else" to implement it?
Nathann
--
You received this
> The sage behaviour follows mpfr_remainder (which it uses);
Is it wise to *not* follow python for something like that?
Nathann
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it,
Hello John,
Here is a way to force your result:
sage: EllipticCurve('11a1').isogeny_graph().show(aspect_ratio=.1)
Graph.plot and Graph.show take a *LOT* of parameters:
1) Options specific to the plotting of graphs
2) Options specific to Graphics.plot()
3) Options specific to
>
> Thanks -- I was half-expecting Nathann to be the first to reply!
It was one of my 'no computer at work' day, sorry :-P
> I don't (or rather, did not) know what D3 is...
>
It is a javascript library for visualisation. If I remember correctly, the
guy who wrote it (used to?) work for
Hellooo,
Note that the renderer here evidently doesn't have edge labels implemented.
> But using D3 (or something built on it) is the future for showing
> "networks" in a webpage. There's many javascript libraries that
> attempt to solve this problem these days.
>
Well, there is if
Hello Rodrigo,
Sage has a Graph class that might help you in what you plan, but from your
message I was not able to guess if you needed 'more' than just a graph
class.
Turns out that we are many here to deal with graph/trees, but we do so in
different ways. My trees are not rooted and not
>
> As long as symbolics gets ignored by most devs such errors will persist.
>
You should try adding stopgap. That helps people notice.
Nathann
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop
Hellooo,
> You are right in that the drawings output by sage do not correspond to the
> planar embedding. The get_embedding method says vertices are ordered in
> clockwise order whereas the drawing output by sage displays them in
> counter-clockwise order.
Oh. So you say that we should
Hell Dominique,
I read your email several times and was not able to find an obvious contadiction
anywhere in what you said, as you seem to understand well what is going on. This
being said, I cannot shake off the impression that you may expect the labels
(names) of your vertices to be
> I tried faces() but faces() is deduced from the "embedding" which is
> right... while subsequent plot is wrong (if you accept to see that in the
> planar plot BDF triangle neigbour vertices of 'B' are read clockwise
> ['F','D'] while in embedding it is ['D','F'])
Are you saying that on some
Hellooo,
Is the following behavior normal:
>
Well... In the first case you work on an exact ring, and in the second case
you compare the output of >= and > on an inexact ring.
I do not know if there is something wrong somewhere, but I do not expect
float computations to be exact either,
Hello everybody,
I very often meet this problem when working on the doc of
combinat/designs/, i.e.:
- There is a link from page of "Graph Constructors" [1] to the general
the general "Graph Theory" page [2] (it appears at the top-left
corner, to the right of Sage's logo).
On the other hand, in
Hello !
> There is no significantly faster method than trying all possibilities.
> Finding the minimum-weight codewords of a linear code is a hard problem.
> Since your code is not too big, the naive method takes only a few seconds.
Thanks for your answer. As it takes something like 40s
> Seriously? At first, it crashed Sage with an error message asking me to
> install some package---which my OS did not know. Volker eventually told
> me that I have to install -devel...
But I know that I have all the packages, for it worked in the past.
> Anyway, if it crashes, I think you
Hell everybody,
I am trying to build an interesting 2-design from the following code:
sage: c=codes.ExtendedQuadraticResidueCode(47,GF(2))
sage: c
Linear code of length 48, dimension 24 over Finite Field of size 2
This is to be done by listing all codewords of minimum weight
> Perhaps %crun helps?
Ahahaa. Well I gave it a try and it crashed Sage every time without
any error message. Didn't feel like debugging this now ^^;
"perf top" does not say much either.
Nathann
--
You received this message because you are subscribed to the Google Groups
"sage-support"
Helloo again,
With this other code cleared, and I went back to this problem. You
were indeed right, I was missing the executable -_-
For some reason it was not here anymore, well. I installed it, and it
did its job. Most of the time seems to be spend on free module
elements, which is "expected",
>> sage: %crun -s cumlative BIBD_45_9_8(True)
>> /home/ncohen/.Sage//sage: line 134: 3174 Profiling timer expired
>> "$SAGE_ROOT/src/bin/sage" "$@"
>
> I got a similar error from time to time. I have no idea how it is
> triggered.
Ticket 19185 apparently fixes it. And I hope that it will also
> isn't it a bit too much code to have this for each backend, rather than just
> something that communicates with the
> frontend only?
Indeed. Were you thinking of something like that?
1) Use GLPK to load a LP/MPS from a file
2) Read the MILP at Python-level
3) Use the info to create a new MILP
> How would it solve the issue of communicating with the frontend?
For this I expect that we should be able to write a function
LP_from_file that returns both a MixedIntegerLinearProgram object and
a MIPVariable object, and that we will have to hack the MIPVariable
object a bit so that it matches
Sorry for asking, but from your question I am note sure that you have
noticed the Vrepresentation and Hrepresentation to be found in the
Polyhedron class?..
This is in SageMath Version 6.6, Release Date: 2015-04-14 running on a
MacBook. The following lines print 'equal', even though m and m1 do not
appear equal to me!
It seems that this equality is an equality over 'double' floats. So not all
digits of your numbers are taken into account.
Is there a way to force a more exact equality test?
It works as intended over QQbar:
sage: QQbar(m) == QQbar(m1)
False
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop receiving emails from it,
PS Testing over QQbar certainly does give False, as it would for m*sqrt(1/2)
and n for any pair of integers (m,n) not (0,0), since sqrt(2) is irrational!
Wouldn't it be better to compare 'exact types' in an exact ring? Here
we compare two exact types in a non-exact field.
Nathann
--
You
I would nevertheless like to try and see if I can get this sage package on
my machine---if only just to see the bug in action myself. Do you know what
might be causing the error I'm getting with sage -i?
No sorry, I really cannot guess what is happening :-/
Nathann
--
You received this
Hello!
(with the bug fixed?).
No, the bug has not been fixed despite having been reported regularly (with
reminders) to the authors. If you like this feature, please consider
writing to the authors to tell them so, and ask them to solve this problem:
Despite what other people are saying in this thread, I definitely 100%
consider the above a bug.
Despite what you say about what other said, I also believe that it is
a bug and that others in this thread agree with you.
But what about *two* bugs?
1) SR says that two unequal things are equal,
2) Why should an_integer * sqrt(1/2) belong to SR? Why isn't it
turned into an algebraic number immediately? If it did, the problem,
Nils answered 2 already and I agree with Nils.
I do not think that he did. The __repr__ function of algebraic numbers
is bad indeed, but if we can have this:
When I do the same for a 3d polyhedron, the background is white.
Given that p3.show(whatever=15) does not raise an exception, I would say
that 'transparent' is not supported for 3d plots and that your argument is
ignored.
Nathann
--
You received this message because you are subscribed
Desperately trying to push something, the function hangs. I also cannot
get to load the ticket I want to update [1] :-P
Nathann
[1] http://trac.sagemath.org/ticket/18681
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this
Yo !
1) Go to google, type in level3, click on search tools - past hour
Come on man, how do you 'guess' level3?
2) https://en.wikipedia.org/wiki/Tier_1_network
I was doing that, but again how do you guess that name? Is there
some book explaining all this?
Nathann
--
You received this
And of course
$ traceroute trac.sagemath.org
Yeah. Well at that time mine involved different operators. Cogentco or
something.
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop receiving emails
Apparently Telekom Malaysia
(https://twitter.com/TMCorp/status/609167065300271104) broke the internet
for a short while until the Tier 1 providers cut them off...
Hey man, can you share the wisdom!?
1) How did you figure that out?
2) How do you learn about internet's organization (Tier 1,
Should we sacrifice a goat ? (Or a manager...)
Things seems normal again here. If you don't think that you will eat
that whole goat by yourself, you can count me in.
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from
Didn't get you. Can you explain a bit more?
A partition of the edges of a graph into disjoint matchings is called
an edge-coloring. With the function I gave you, you can compute an
edge-coloring of your graph which, because that graph is a K_{n,n},
will be a collection of disjoint perfect
Say I have a K_{n,n} and from it I want to extract d mutually disjoint
perfect matchings.
How can this be done?
http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/graph_coloring.html#sage.graphs.graph_coloring.edge_coloring
--
You received this message because you are
I just looked at the code and it seems that vertex_shape is an alias for
the marker parameter from matplotlib.
Thus, the possible shapes are there:
http://matplotlib.org/api/markers_api.html
We should add this information in the documentation of graph plot options
Small update on the 'modular decomposition story'.
Today I ran valgrind on the code, and ended up finding where the error
comes from. Around line 972 of dm.c, one can find:
for(v = n-1; v=0; v--)
if(ds[v-1] != -1){
L2[v]=v;
while( pile[sommet] ds[v-1])
Was it about the same version of their code?
I cannot swear that they have not changed a single character of their
code in the meantime. What I can tell for sure is that the same error
still exists at the same line of their file, on the copy I downloaded
this morning.
Maybe we should tell the
I trust that you know the proper order of these powerful French words
starting from p and m better than me. ;-)
I sent them an email asking if anything had been done about this bug,
and saying that we would remove the code otherwise.
Nathann
--
You received this message because you are
maybe we should just keep posting strong-worded statements about quality of
that code,
perhaps in French ;-)
I prefer your technique. You are waiting for me to do something about it, right?
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support
Hello !
Thank you very much. With your help I was able to compile the library from
the new sources and it is working properly now, although just for me of
course.
Good :-P
I understand your disappointment because of not being able to solve
the issue for everybody.
I am willing to write
Hello !
I would like to know if there is any workaround for solving this issue for
version 6.6. Unfortunately, there is no dm.c and no random.c in the sage 6.6
directory structure so as to replace them and so I do not know how to
proceed.
Sigh... Modular decomposition. A story of many
Hello,
I am not sure that I understood your message very well. Are you saying
that one way to achieve what you do would be to call the current
subgraph_search methods, and to *filter* among its results those
which are actually *equal* (considering edge labels) to the graph you
are looking for?
I created ticket #18296 to try to make it clearer.
http://trac.sagemath.org/ticket/18296
Nathann
On Thursday, April 23, 2015 at 2:46:01 PM UTC+2, Nathann Cohen wrote:
By the way: in Sage, you do not need to create the vertices before
creating the edges. Adding the edges will also add
Hello,
These functions do not take edge labels into account. When the
documentation says that it counts/enumerates/find 'labeled' copies of a
graph, it means precisely that the number of copies of a graph G in itself
is equal to the size of Aut(G), the automorphism group of G.
It is the same
By the way: in Sage, you do not need to create the vertices before creating
the edges. Adding the edges will also add the vertices.
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop receiving emails
Hello again!!!
You're riight. After looking carefully at my definition of cy (the cyclic
order of the non zero group elements that give the cyclic order of the edges
around each vertext) I noticed that instead of A*C^-1 I had AC^1. Once I
corrected that everything works.
Cool. Mystery
Hello,
I'm looking at embeddings of complete gaphs and I think I've found a bug: I
defined the complete graph k12 as a (sort of) Cayley graph of the group
Z₂²× Z₃ as follows:
First, it seems that the Python code you copy/pasted in your message lost
its indentation. Thus, I have no way to
It would be more natural ro convert it to a matrix group, and then use
the natural action of this group.
This is related:
http://www.sagemath.org/doc/reference/combinat/sage/combinat/integer_vectors_mod_permgroup.html
Nathann
--
You received this message because you are subscribed to
Hello !
(it seems like is_connected should really only be used for undirected
graphs).
It is useful from time to time in digraphs too. Sometimes you cannot split
a DiGraph problem into one sub-problem for each strongly connected
component, yet it is possible if you consider independently
Also, I do not understand why you have so many expressions like:
(val*bm.transpose())[0,0]
If you have performance problems, do not compute a whole matrix if you
are only interested by its [0,0] coordinate O_o
You call j.transpose() repeatedly. Store jt=j.transpose() and use it.
Store and use
Just to say that this got fixed in #17320
http://trac.sagemath.org/ticket/17320
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
Hello !
This post reminds me of
https://groups.google.com/d/topic/sage-devel/awjiHPph6f8/discussion
which in turn
became: https://groups.google.com/d/topic/sage-devel/q5uy_lI11jg/discussion
None of which have been addressed since, I believe.
Nathann
--
You received this message because
The edge_coloring command has a dedicated hex_colors argument::
sage: edge_coloring(graphs.CycleGraph(6),hex_colors=True)
{'#00': [(0, 5), (1, 2), (3, 4)], '#ff': [(0, 1), (2, 3), (4, 5)]}
If you want to see the edge coloring, you can do:
sage: g = graphs.PetersenGraph()
Please consider adding on Python mainstream webpage some info about Sage
project. It was a great idea to choose Python as a main programming
language to implement Sage project.
So I think that python and python foundation will be proud to hear about
that. So I think that it will be good
Yo !
Ah, seems to be quite a compact form!
Yeah, but it only does what you want. Nothing involving more
complicated objects like category functions do.
But after two days of wondering I don't know how to generate all lower
triangular matrices with non-zero elements taken from, say, [0,1].
Yo !
Ah, seems to be quite a compact form!
Yeah, but it only does what you want. Nothing involving more
complicated objects like category functions do.
But after two days of wondering I don't know how to generate all lower
triangular matrices with non-zero elements taken from, say, [0,1].
Yo !
Uh, cartesian_product and CartesianProduct on same system. My love-hate
-relationship to Sage just moved slightly to hate-side.
Please, be respectful of other people's work and focus your hate on Sage's
categories. The rest is quite fine :-P
I only wanted to add on the same topic that
That's because you need to explicitly import/define sig_on and sig_off. I
guess that this is done automatically when the extension is .spyx.
In the file sage/graphs/cliquer.pyx it is done with the line :
include sage/ext/interrupt.pxi
Nathann
On Sunday, August 17, 2014 10:11:48 PM UTC+2, Paul
Hello !!
Using
G.relabel( [ i+1 for i in range(G.order()) ], inplace=True )
and repeat the same command once more causes the error below.
That is because of that (rom the doc of Graph.relabel) :
If ``perm`` is a dictionary ``d``, then each vertex ``v``
(which should be a
Okay, thanks to this vector trick I was able to do what I wanted. Do you
believe that the syntax should be changed so that A(vector(whatever)) has
the same result as A(whatever) ? vector does not add a very meaningful
information here ...
Nathann
--
You received this message because you are
Hello everybody !
I need to use the elements of GF(8,'x') x Z/3Z as an additive group. Is
there a way to do this with Sage ? I need that to add more combinatorial
designs :-)
Thanks !
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To
The problem is now fixed by this ticket :
http://trac.sagemath.org/ticket/16257
If you can review it, it will be merged faster, possibly into the next
release :-)
Thanks for the report,
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
I think that the point is to allow creation of elements either with respect
to the input generators (using vector) or with respect to the simplified
generators (without vector). Since both sort of input look the same (tuples
/ lists) I am guessing that the trick of using vector is just
Thats it.
The syntax is awful, do we agree on that ?
-1, some method returns an abelian group and you don't know how it was
constructed without having to dig around.
?
But when I create a group by myself which I want to be equal to Z/2Z *
Z/3Z I end up with something different, isn't that a
Helloo !!!
I think this is right. Allocating copying such a huge matrix repeatedly
would be terrible. Perhaps we should introduce an API function to
add_constraints, which takes a list of lists, or a matrix? If a solver
doesn't support such a thing, we could fall back on
Its always going to be somewhat confusing to have both the original
definition and a canonical form around. Feel free to add more descriptive
construction methods for elements. The ctor argument convention is because
that was chosen originally and I didn't want to break code when refactoring
I don't think that will work if you are relying on the error message to
indicate the wrong length of input. For example:
sage: AdditiveAbelianGroup([6,2])
Additive abelian group isomorphic to Z/2 + Z/6
Now you will expect the element (1,0) to have order 6 but it has order 2.
No, this
I would think that this is incompatible with the current syntax.
Yes of course, that changes the default ! But I am not so sure that it
would break many things, as the current implementation is so
unreliable that you cannot guess what G accepts as input, unless you
made sure to define it with a
Hence it can break code that people have written privately.
I believe that not so many have written such code, for the very same
reason. But indeed if we change that we will need a deprecation step.
Don't you agree that this change would make sense ?
I just did the change I mentionned above,
The default repr is in terms of smith form gens, so IMHO it makes more sense
to default to a linear combination of smith form gens. Imagine some method
returns an abelian group, how are you going to construct elements?
Well, obviously by changing repr, no ? O_o
Nathann
--
You received this
I mean ... Really, nobody cares what the smith form generators are.
It's a technical problem, the user does not even have to be aware of
that !
Nathann
On 28 April 2014 17:19, Nathann Cohen nathann.co...@gmail.com wrote:
The default repr is in terms of smith form gens, so IMHO it makes more
Moreover, how are you going to deprecate it? When is a deprecation warning
shown?
Ahahahah. That's an interesting question, but the current way being
bad, there is absolutely no way that it will stay like that forever
just because we don't know how to tell the users :-D
I had something a bit
To be honest, I would prefer to do the opposite. Changing it now while
printing a message saying that the format changed, and removing the
message one year from now.
Nathann
On 28 April 2014 17:27, Nathann Cohen nathann.co...@gmail.com wrote:
Moreover, how are you going to deprecate it? When
Showing a deprecation warning for valid input isn't ideal ;-)
Indeed, indeed. Right now it prints the following input, which I hope
will be taken seriously by those who should, and be ignored by those
who should :
sage: x = A([5]); x
doctest:1: DeprecationWarning: The default behaviour changed
, and a symptom of what Nathann wants to fix. It should be
fixed.
John
On Monday, April 28, 2014 8:27:45 AM UTC-7, Nathann Cohen wrote:
Moreover, how are you going to deprecate it? When is a deprecation
warning
shown?
Ahahahah. That's an interesting question, but the current way
Ahahaah. While writing that code, I met an infinite loop. Apparently
testing if an element of a group is equal to +infinity calls
__repr__... :-P
Nathann
On 28 April 2014 18:16, Nathann Cohen nathann.co...@gmail.com wrote:
Showing a deprecation warning for valid input isn't ideal ;-)
Indeed
The current branch passes all tests in groups/ and modules/fg_pid/ :-)
Needs review !
Nathann
On 28 April 2014 18:29, Nathann Cohen nathann.co...@gmail.com wrote:
Ahahaah. While writing that code, I met an infinite loop. Apparently
testing if an element of a group is equal to +infinity calls
Hello again !
This time the branch passes all long tests in src/ except one, and I need
your advice. Here is the problem :
**
File chain_complex.py, line 738, in
sage.homology.chain_complex.ChainComplex_class.grading_group
(or just add in the warning that
the users should use G(vector(x)) instead of G(x), which removes the
warning too).
Nathann
On 28 April 2014 20:38, Nathann Cohen nathann.co...@gmail.com wrote:
Hello again !
This time the branch passes all long tests in src/ except one, and I need
your
? Nathann
On Monday, 28 April 2014, Dima Pasechnik dimp...@gmail.com wrote:
On 2014-04-28, Nathann Cohen nathann.co...@gmail.com javascript:;
wrote:
Hello everybody !
I need to use the elements of GF(8,'x') x Z/3Z as an additive group. Is
there a way to do this with Sage ? I need
Hello everybody !
I am back again with my group problems. I need to see 4-uples as elements
of the additive group Z/3Z x Z/2Z x Z/2Z x Z/2Z, how can I do that ? My
problem is that Sage converts the group I want into Z/2Z x Z/2Z x Z/6Z
and I don't want that
sage:
P.S. : I need to add some of those tuples together...
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To
REALLY
The group is internally 4-tuples, but it only accepts 3-uples as input.
sage: g=groups.misc.AdditiveAbelian([2,2,2,3]); g
Additive abelian group isomorphic to Z/2 + Z/2 + Z/6
sage: print list(g)
[(0, 0, 0, 0), (0, 0, 1, 2), (0, 0, 0, 1), (0, 0, 1, 0), (0, 0, 0, 2), (0,
0, 1,
, 1, 1, 1)
sage: A(vector([1,1,1,1])).order()
6
Read AdditiveAbelianGroup? for more.
John
On 26 April 2014 16:16, Nathann Cohen nathann.co...@gmail.com wrote:
Hello everybody !
I am back again with my group problems. I need to see 4-uples as
elements of the additive group Z/3Z x Z/2Z
1 - 100 of 277 matches
Mail list logo
