2019-11-11 20:30:14 -0500 | received badge | ● Good Answer (source) |

2019-08-27 14:54:11 -0500 | received badge | ● Nice Answer (source) |

2019-06-10 09:25:32 -0500 | received badge | ● Nice Answer (source) |

2019-03-12 15:11:08 -0500 | received badge | ● Taxonomist |

2018-06-30 20:42:10 -0500 | commented question | How can I change the sage console prompt? If relevant to anyone with a dark background in their terminal wanting to change the color in the prompt, an option is to go to |

2018-06-30 19:05:01 -0500 | commented answer | Drawing Auslander-Reiten quivers with sage possible? You are welcome :-) |

2018-04-03 02:35:49 -0500 | received badge | ● Nice Answer (source) |

2017-10-10 21:09:17 -0500 | edited question | What are the following commands telling us? R=Integers() [R.ideal([a,b]) == R.ideal([gcd(a,b)]) for a in range(1,20) for b in range(1,20)] What are the following commands telling us? |

2017-10-08 15:58:45 -0500 | commented answer | Finding all simply laced Dynkin graphs with a given number of vertices up to isomorphism @maresage Would you please be so kind to try and donate via paypal to the address listed here? This info is also available here(They're collecting money for helping repair damage from the quake in Oaxaca). If this is not possible, then donating to sagemath would be nice. You can donate through the top right link at sagemath.org or via this direct link. You may contact me via the |

2017-10-06 12:12:15 -0500 | answered a question | Finding all simply laced Dynkin graphs with a given number of vertices up to isomorphism Here is some code that might do the job. Please feel free to test it and let me know if this works. Sample usage: produces Which can be saved to a file. It takes about half a second to go up to |

2017-10-06 11:29:04 -0500 | commented question | Finding all simply laced Dynkin graphs with a given number of vertices up to isomorphism Guess the purpose of $E_n$ is having the $n$-th vertex anchored at the third vertex of the path from left to right, correct? |

2017-10-06 11:27:58 -0500 | commented question | Finding all simply laced Dynkin graphs with a given number of vertices up to isomorphism What exactly do we mean by "fast code"? Any memory usage constraints? Is a 1 minute wait reasonable for $n=13$? |

2017-10-06 11:02:42 -0500 | commented question | Finding all simply laced Dynkin graphs with a given number of vertices up to isomorphism Is $E_n$ defined for all $n\geq 6$? Or is it just for $n\in{6,7,8}$? |

2017-09-27 16:33:28 -0500 | commented question | How to run maple in cocal? Provided you manage to install it, it might be possible. |

2017-09-24 16:34:55 -0500 | commented question | Finding posets of a certain form 2 Depending on what you are planning to do with these posets, it might be worth filtering them up to a certain size and store the output. So that you can just go back and read from the stored list. However, if you are interested in say, counting them, then maybe generating them will be the way to go. |

2017-09-24 16:31:52 -0500 | commented question | Finding posets of a certain form 2 This looks like a very particular set of posets. Maybe you'll need to generate them manually if you do not want to filter from the list of all posets. |

2017-09-24 16:09:02 -0500 | commented question | Finding posets of a certain form 2 By Hasse quiver, do you mean Hasse diagram? If so, then you may use the |

2017-09-24 16:05:14 -0500 | edited question | Finding posets of a certain form 2 I try to obtain the connected posets with n elements having a top and bottom such that in the Hasse quiver, in every point there start at most two arrows and at every point there end at most two arrows (thus for example all distributive lattices are of this form). Is there a quick command to obtain this as a list? What condition does one has to add in Actually a quick method would be cool which works up to n=10 or 11. (filtering things out of the set of all posets, seems to be very slow in SAGE) |

2017-09-24 16:01:36 -0500 | commented answer | Output too long in SAGE @maresage |

2017-09-23 19:57:22 -0500 | commented question | Output too long in SAGE [Bug report (?)] Should |

2017-09-23 19:54:27 -0500 | answered a question | Output too long in SAGE To save to a file, you may try the following. Searching for "write to file in python" might give some insight into this aspect of Python. If you wish to process a list by chunks, then looking up "slicing in Python" might be useful. Given a list |

2017-09-23 00:20:07 -0500 | answered a question | Call error for integers (when I haven't declared any.) Your code contains syntax errors. One of the problems seems to be: This is being interpreted as Seems like this is the only error. |

2017-09-22 05:29:43 -0500 | answered a question | Stochastic block model Assuming the input consists of This is assuming that |

2017-09-22 05:06:05 -0500 | commented question | Stochastic block model Are the sizes of the communities given as part of the input? Maybe this is what the comment above is trying to address. Is the probability of edges between vertices in different communities equal to 0? |

2017-09-21 13:46:10 -0500 | commented answer | eigenvector corresponding to largest eigenvalue @A You can always upvote/accept if it helped ;-) |

2017-09-21 10:32:40 -0500 | answered a question | eigenvector corresponding to largest eigenvalue Why not just use the following? Here In your example this outputs: The proposed code does not work since is invertible (determinant very close to zero). Note that |

2017-09-20 18:20:05 -0500 | commented answer | Obtaining all posets in a certain form with SAGE @dan_fulea Seems like OP requires both. For a poset |

2017-09-20 18:15:14 -0500 | commented answer | Obtaining all posets in a certain form with SAGE @maresage Did you mean Regarding the previous question, this output already contains Which is the middle poset in the output above. |

2017-09-20 15:55:49 -0500 | commented answer | Obtaining all posets in a certain form with SAGE @maresage Seems like your comment is truncated. Answer has been updated with the format you provided. |

2017-09-20 15:55:08 -0500 | commented answer | Obtaining all posets in a certain form with SAGE @dan_fulea Were these questions meant to be on the original post? |

2017-09-20 15:54:11 -0500 | commented answer | Obtaining all posets in a certain form with SAGE @maresage Other answer has been updated, it reflects the update on format. |

2017-09-20 09:37:36 -0500 | answered a question | Obtaining all posets in a certain form with SAGE Not entirely clear what the question was. Or was this an implementation request? In case you were looking for an implementation, here is a possible way of doing it. :-) Now you should be able to just issue: Observe that if you just wish to format a single poset, you can do so via Hope this is useful. Update: Adapted to new output format. |

2017-09-14 02:55:26 -0500 | received badge | ● Nice Answer (source) |

2017-09-13 10:15:33 -0500 | answered a question | Symbolic to numerical array Would count as a single command? If |

2017-09-10 20:50:45 -0500 | commented answer | How do I get solve () to use floats? @Lesparagus Indenting the block of code by 4 spaces should be enough to get syntax highlight. No need to surround the code by anything else. That should do the trick. |

2017-09-09 21:43:48 -0500 | commented answer | Set Covering Algorithm Maybe another option is to index variables by the sorted tuple representing the set? |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.