2018-04-07 12:26:28 -0600 | received badge | ● Notable Question (source) |

2015-06-04 15:12:06 -0600 | received badge | ● Taxonomist |

2015-04-29 20:42:57 -0600 | received badge | ● Notable Question (source) |

2015-04-29 20:42:57 -0600 | received badge | ● Popular Question (source) |

2015-04-29 20:42:57 -0600 | received badge | ● Famous Question (source) |

2014-06-17 15:23:52 -0600 | received badge | ● Popular Question (source) |

2013-12-17 07:58:26 -0600 | received badge | ● Popular Question (source) |

2013-04-05 02:13:58 -0600 | received badge | ● Popular Question (source) |

2013-02-03 11:15:31 -0600 | commented answer | where to put a public worksheet referenced in a paper? Daniel -- were you able to successfully upload the sws file to the arxiv? |

2011-05-05 09:24:53 -0600 | asked a question | How can I construct modules as quotient algebras? I would like to do the following: given a field k and an ideal I of A = k[x1,...,x_n], I would like to construct the k-module A/I and, when A/I is finite as a k-module, compute its rank. Is this possible in Sage? |

2011-04-20 05:24:22 -0600 | commented question | RSS feeds for questions Not exactly; I'm looking for an RSS feed for all activity on a single question page (rather than the main page). |

2011-04-18 12:59:55 -0600 | asked a question | RSS feeds for questions Is there any plan to add RSS feeds for particular questions (as in MathOverflow or other SE sites)? |

2011-04-18 12:58:19 -0600 | asked a question | Matrix of Frobenius action on the de Rham cohomology of a curve. I'd like to be able to compute the matrix of Frobenius action on the de Rham cohomology of a curve in characteristic p. Has this been implemented in SAGE? I couldn't find anything in the documentation, or googling for papers which compute this. Also, computation of the Hasse Witt Matrix has been implemented. |

2011-02-27 01:14:10 -0600 | received badge | ● Nice Question (source) |

2011-02-26 11:02:07 -0600 | received badge | ● Student (source) |

2011-02-26 07:37:06 -0600 | received badge | ● Supporter (source) |

2011-02-26 07:37:04 -0600 | marked best answer | How do I create subsets of sets? Here is one solution: For more documentation on this, look for list comprehensions in your favorite Python documentation. |

2011-02-26 07:17:51 -0600 | asked a question | How do I create subsets of sets? How do I create, for example, the set of all primes less than 100 which are congruent to 1 mod 6? In Magma, I would do something like this: After 25 minutes of searching the Sage documentation, googling, and trying things at random, I can't figure out how to make such a construction in Sage. (I'm not so interested in this particular set, but rather how to do constructions like this in general [e.g., the subset of all matricies whose given minor has a certain rank, etc.). |

2011-01-26 04:25:56 -0600 | commented answer | How do I nest functions? I was spelling cardinality wrong in sage... |

2011-01-26 04:25:39 -0600 | received badge | ● Scholar (source) |

2011-01-26 04:25:39 -0600 | marked best answer | How do I nest functions? Actually it works. Can you post the error? |

2011-01-25 16:06:43 -0600 | received badge | ● Editor (source) |

2011-01-25 16:05:37 -0600 | asked a question | How do I nest functions? The following code returns an error, while the code works fine. Is there a way to do this on one line? (Note: I don't particularly care about this with elliptic curves, I'd just like to be able to do things like this in one line. In other words, I'm not looking for a mathematical answer. Also, I'm asking for something different than, say, this .) |

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.