2021-04-20 00:56:49 +0200 | received badge | ● Popular Question (source) |

2021-04-20 00:56:28 +0200 | received badge | ● Popular Question (source) |

2019-02-10 19:15:43 +0200 | received badge | ● Nice Question (source) |

2017-10-10 22:48:19 +0200 | received badge | ● Notable Question (source) |

2017-10-09 14:01:28 +0200 | received badge | ● Famous Question (source) |

2016-11-30 00:47:24 +0200 | commented question | plotting 3d polytope in R^4 I tried different projection directions, and always the plot seems to have the same non-convexity issues. I guess there is something wrong with these projections. |

2016-11-30 00:45:53 +0200 | commented answer | plotting 3d polytope in R^4 The documentation of affine_hull should be more specific telling what is the output polyhedron, and in which sense it is the same as the original one. As I see, in this example it is a projection to the first 3 coordinates, but it is not similar to the original one, but only affinely equivalent. |

2016-11-23 21:27:10 +0200 | asked a question | plotting 3d polytope in R^4 I'm trying to plot the following polytope on the cloud: This is a polytope living in R^4, but in fact the sum of the coordinates of each vertex is 5, so it is a 3D polytope. In some cases, sage gives me a nice 3D view of how the polytope looks like, but in this case it gives me something that doesn't even looks convex, so it is not the right projection. I would like to know what is going on and try to solve this issue, so I appreciate ideas on how to correct this, and where to look at on the code. |

2016-11-05 11:39:17 +0200 | received badge | ● Good Question (source) |

2016-09-16 03:07:41 +0200 | received badge | ● Nice Question (source) |

2016-09-16 01:04:32 +0200 | asked a question | chromatic polynomial of empty graph I know it is kind of silly, but the computation of the chromatic polynomial of the empty graph loops forever. (no question here... just a comment. I guess it is easy to correct, since it is supposed to be 1) |

2016-09-16 00:52:52 +0200 | received badge | ● Popular Question (source) |

2016-09-16 00:52:30 +0200 | received badge | ● Popular Question (source) |

2016-09-16 00:52:30 +0200 | received badge | ● Notable Question (source) |

2016-08-20 06:57:05 +0200 | received badge | ● Popular Question (source) |

2015-09-08 20:04:26 +0200 | received badge | ● Notable Question (source) |

2014-12-01 19:06:51 +0200 | commented answer | plot Polyhedron from cloud Indeed it works now, and is very fast, but still the results are not as good as with jmol. There I was using the thickness option to plot lines and edges and I get 3d objects that are thick cylinders, but here is not as pretty. Also I don't understand the shadows of the colors of the facets of the icosahedron. Anyway thanks a lot! |

2014-12-01 18:45:16 +0200 | commented answer | interactive drawing and tikz thanks! they are even implementing some sort of python capabilities now... Great! |

2014-10-29 18:57:54 +0200 | received badge | ● Student (source) |

2014-10-29 17:57:17 +0200 | asked a question | plot Polyhedron from cloud I'm trying to plot some 3d stuff from the cloud. I tried: and worked perfectly, but then I tried and I only get a single bullet, no error message, no image, no nothing... What is going on? |

2014-07-03 00:25:08 +0200 | received badge | ● Taxonomist |

2014-06-25 16:08:25 +0200 | received badge | ● Popular Question (source) |

2013-04-08 13:31:48 +0200 | asked a question | music in sage hi! I would like to see some music features support in sage so that it is possible to easily do some math and music experiments from sage. Do you know a good package that could be added for that purpose? It would be great to have this kind of features from default in a sage instalation, like playing with frequencies and waves to produce nice sounds. Feel free to give here more ideas to that. |

2012-09-17 20:29:09 +0200 | asked a question | interactive drawing and tikz I would like to see something like this in sage: -A graphic object that works similar to tikz and the result can be exported almost directly to tikz code. -It also uses nodes that can be rendered in an interactive window so that all mathematical constructions are updated as you move the nodes, as in some geometry interactive software (like cabri or geometer sketchpad). What could be a good way to get there? Which alternatives for rendering software might help? |

2011-06-26 08:28:17 +0200 | commented answer | How do I get sage to honor my PYTHONPATH environmental variable? I'm also interested in this, but unfortunately I don't understand much of what is here written. Is it possible to explain this again for a computer newbie? (I'm trying to do this with ubuntu) |

2011-05-31 08:52:58 +0200 | received badge | ● Supporter (source) |

2011-05-12 06:54:34 +0200 | answered a question | why remove_face uses alexander duality? try this: |

2011-05-04 06:05:43 +0200 | received badge | ● Organizer (source) |

2011-05-03 13:59:24 +0200 | received badge | ● Editor (source) |

2011-05-03 13:56:34 +0200 | answered a question | why remove_face uses alexander duality? This is the code I got. I'm still novice with python stuff... There is a minor problem now in case that FACE is not a face of SC. Maybe an error can be added, but I think the algorithm is right, and the problem is in the way the link is computed. The problem is that the link of a simplex not being a face in the complex is not the simplicial complex {()} (the irrelevant complex), but simply {} (the void complex). The link definition doesn't include the empty set in this case, so the answer is tecnically wrong. If the link is void, the join would be void, and no faces are added or removed... Besides, if the link makes this difference, it can be used as a test for a simplex being a face (since {} is supposed to be false). I tested the examples to compare results with sage documentation (here FACE must be a Simplex), but with real examples (a bit bigger), I didn't manage to wait for sage, while my algorithm was about a second... Regards! |

2011-04-27 12:56:04 +0200 | asked a question | why remove_face uses alexander duality? The method for simplicial complexes remove_face is very slow for not to say that never ends. The documentation describes the used algorithm, but it seems pretty unefficient. I think it is easier simply to remove the facets containing the face to delete F, and for each facet add the faces not containing F. That is the join of the boundary of F and the complement of F (the link). Why to use such elaborate algorithm? |

2011-03-29 12:42:06 +0200 | answered a question | h_vectors of simplicial complexes I also noticed that there where no h_vectors in the old documentation... However I messed everything up with the upgrade and now nothing is working (I didn't check before the right way to do it and try to reinstall everything from the begining). This is the situation now: when I run ./sage I get a long message telling at the end: then after running %upgrade I get the following and then I hope you can tell me what to do now... |

2011-03-29 11:51:42 +0200 | received badge | ● Scholar (source) |

2011-03-29 11:51:42 +0200 | marked best answer | h_vectors of simplicial complexes Could you edit your message to include a cut-and-paste of exactly what you did and what error message it returned? It seems to work for me just like in the examples, but I'm running Sage 4.6.2 and don't know about earlier versions: |

2011-03-25 07:13:33 +0200 | commented answer | h_vectors of simplicial complexes I have a 4.6.1 version of sage, but is installed somewhere else, so I cannot send you the precise error message. I think I should try an update... Thanks! |

2011-03-25 06:44:51 +0200 | asked a question | h_vectors of simplicial complexes In the documentation for finite simplicial complexes it was described the function h_vector, but when I tried to use it, sage told me that there was not such a property for simplicial complexes. Where can it be the problem? |

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.