20190814 05:38:59 0500  received badge  ● Good Answer (source) 
20190811 18:23:42 0500  commented question  Submitting code to Sage The Sage Developer's Guide is the first step. 
20190809 08:09:06 0500  received badge  ● Nice Answer (source) 
20190808 10:54:34 0500  commented question  The shortest string containing all given substrings If you want a Sagemath solution, there is http://doc.sagemath.org/html/en/refer.... You would have to translate the numbers 1, 2, ..., 7 to the letters a, c, d, ... h, but that should be easy. 
20190808 01:13:10 0500  received badge  ● Nice Answer (source) 
20190807 13:47:18 0500  answered a question  tree ordering in sage The documentation in the reference manual says that it is using the algorithm from this paper. 
20190805 22:25:22 0500  commented answer  How to draw a graph whose vertices are elements of permuation group

20190805 13:23:17 0500  answered a question  Why GF(256) matrix only have zero and one number? If you want to work mod 256, you should work with (edited to add the second example)

20190805 11:52:47 0500  answered a question  How to draw a graph whose vertices are elements of permuation group For #1: For example: At this point, 
20190805 10:17:05 0500  received badge  ● Good Answer (source) 
20190804 08:35:26 0500  received badge  ● Good Answer (source) 
20190804 03:44:52 0500  received badge  ● Nice Answer (source) 
20190802 14:25:56 0500  commented question  I just built a Sage system. What files may I delete with impunity? Why version 7.6? That's pretty old. Did more recent versions fail for you? 
20190802 14:25:30 0500  answered a question  I just built a Sage system. What files may I delete with impunity?

20190801 20:19:54 0500  commented answer  Trying to get the divided differences of a list of points @Macacroso: I wasn't trying to criticize, rather trying to help in the future. For me, once I know how to really use the documentation, it helps me whenever I use the software. 
20190801 11:38:07 0500  received badge  ● Nice Answer (source) 
20190730 23:05:18 0500  answered a question  Docstring docs and html docs are different This function is here in the reference manual. This is one of the many listings when you search for "factor" in the reference manual, but it's nowhere near the first one. You can find it by looking at the end of the output for 
20190729 18:31:08 0500  commented answer  How can I assign different degrees to the variables of a polynomial ring? A mistake. I was going to give the links in the other order and then decided that I preferred this order instead. 
20190729 13:20:21 0500  received badge  ● Nice Answer (source) 
20190729 12:26:04 0500  answered a question  How can I assign different degrees to the variables of a polynomial ring? You can use "weights": I think this is not documented very well, or at least I didn't discover it easily. See http://doc.sagemath.org/html/en/refer... and http://doc.sagemath.org/html/en/refer.... 
20190729 12:13:25 0500  commented answer  How can I assign different degrees to the variables of a polynomial ring? This unfortunately is not a polynomial ring, since 
20190729 08:07:05 0500  received badge  ● Nice Answer (source) 
20190728 17:25:01 0500  received badge  ● Nice Answer (source) 
20190728 15:09:25 0500  commented answer  Is there a function to render latex or html in a notebook from a string ? The answer is over 8 years old, so it would be a little surprising if it did still work. Sage has changed, the notebook has changed, etc. 
20190727 15:25:58 0500  commented answer  Trying to get the divided differences of a list of points For future use, if you find something like this in the Sage reference manual (like http://doc.sagemath.org/html/en/refer... or http://doc.sagemath.org/html/en/refer...), there will probably be examples showing exactly how to use it. 
20190726 17:36:07 0500  answered a question  Is there any way to have a cell tell you how long it took to run in the Jupyter notebook? You can put See also https://stackoverflow.com/questions/3... and https://nbviewer.jupyter.org/github/i... 
20190726 16:20:19 0500  commented question  Is there a binary version of SageMath .app.dmg compatible with Mac OS X ver. 10.14.6 I posted this on sagesupport, but the 
20190723 09:36:07 0500  received badge  ● Good Answer (source) 
20190721 09:34:02 0500  received badge  ● Nice Answer (source) 
20190719 22:32:18 0500  answered a question  Why does .remove() seem to take every element out of a list? When you evaluate Note that there is no output from the second line: it returns nothing. This in contrast to something like the 
20190702 21:25:32 0500  received badge  ● Nice Answer (source) 
20190625 19:02:23 0500  commented answer  wrapping vector class Oh, also, as @slelievre said in answer to a separate question of yours, using .py files, not .sage files for this kind of work. 
20190625 18:59:00 0500  commented answer  wrapping vector class First, use 
20190625 16:14:49 0500  commented answer  wrapping vector class To find where to import, use 
20190625 16:00:54 0500  edited question  wrapping vector class I am trying to wrap the vector class to add some extra cases, but I am having trouble doing so. This is the code I have: However, I get the following error when running on terminal and the following on the Notebook Any idea of what I am doing wrong? 
20190625 15:50:19 0500  answered a question  wrapping vector class In Sage, I found this by looking at the help for Actually, So you could instead inherit from Edit: to use 
20190622 17:24:04 0500  commented question  find all matchings in a graph A problem with my suggestion is that I don't know how to get Sage to tell me all maximal matchings. It produces a single one easily enough, but I don't know about all of them. 
20190622 17:17:09 0500  answered a question  find all matchings in a graph I don't know how efficient this is, but to find all matchings with a fixed number of edges, you can do this: Now look for sets of 
20190622 17:07:44 0500  commented question  find all matchings in a graph I suppose you could work recursively: ask for all maximal matchings in 
20190620 13:12:43 0500  commented answer  Testing if the entries of a matrix of rational vectors are actually integers That one takes 16.2 ms per loop, and the others are about 3.5 ms per loop, so the others are faster. 
20190620 10:16:22 0500  received badge  ● Nice Answer (source) 
20190618 15:18:20 0500  commented answer  how to generate Cayleygraph I don't know. You can look at the documentation for the cayley_graph method: http://doc.sagemath.org/html/en/refer... 
20190618 12:13:33 0500  edited answer  Testing if the entries of a matrix of rational vectors are actually integers If you know that you are dealing with 5x4 matrices, for example: Or if you don't know the size: This seems to be a little faster than Revised timings to also compare the 