2021-02-09 11:59:26 +0200 | received badge | ● Popular Question (source) |

2021-02-09 11:53:56 +0200 | answered a question | cell complexes vs simplicial complexes I would recommend you to have a look at the documentation: For general cell complexes For simplicial complexes Note that they have different methods available and that they might not offer the state-of-the-art methods for what you mean, but it is worth trying! |

2021-01-19 17:28:03 +0200 | received badge | ● Necromancer (source) |

2020-12-16 13:44:16 +0200 | answered a question | Finding certain partitions using Sage If I adapt the problem to the comment, it is possible to use integer points in polyhedra.
First, one creates the polyhedron of partitions in For If my code is not correct, one may still modify it to get the proper definition of admissibility... |

2020-12-16 13:31:22 +0200 | commented question | Finding certain partitions using Sage The partition |

2020-08-24 02:47:44 +0200 | received badge | ● Nice Answer (source) |

2020-08-23 21:57:21 +0200 | answered a question | Obtaining quotient posets of the Boolean lattice via Sage Here is a snippet of code that can be used to produce the desired quotient poset. It is not meant to be the most optimal way, but it does return the desired object. To obtain all of the quotient posets, one should then loop over all permutation subgroups of $S_n$. These subgroups can be obtained this way: |

2020-07-28 12:14:55 +0200 | answered a question | rotating polytope in 4d? The current default viewer in Sage is now threejs. To visualize a 4-dimensional polytope, you can do: This will open a html page in the default internet browser (this might be a problem, as sometimes if the browser was updated it might not open a new tab). In there, there will be a threejs applet which you can play with with mouse-clicks. You are probably refering to the pop up menu from the jmol viewer, which is still accessible (though likely is less maintained now as it is not the default viewer anymore): There, you may right-click and select "console" where you can then type commands to rotate and change the view. As far as I know, there was no possibility to change the projection view (from 4d to 3d) once the picture of the Schlegel diagram has been produced. It is possible to change the projection view, for this, you may proceed to play around as follows: |

2020-07-24 09:41:57 +0200 | commented answer | Shelling order of a simplicial polytope Sure! If you want to keep track of the development related to polyhedral geometry in Sage visit the Polyhedral Geometry Trac Wiki. The .boundary_complex method is in Sage since version 9.0. |

2020-07-24 09:30:16 +0200 | answered a question | Shelling order of a simplicial polytope Dear Guillermo, The answer to your question is yes. Here is an illustration with the octahedron: Finally, we can get the actual sequence of facet using our dictionary. |

2020-07-16 06:11:05 +0200 | received badge | ● Nice Answer (source) |

2020-04-26 21:48:43 +0200 | marked best answer | How to literally print the output of tab completion in the command line? Some time ago, I realized that pressing tab after a "." in the command line opens a new window where it is possible to scroll through the possible methods to call on this object. Is it still possible to print inside the terminal all the possibilities? Even if I modify the preferences of the command line from "readline" to "multicolumns", it still does not show much of the possibilities and sometimes seeing all of them at once is faster than scrolling. Is it possible to get this feature back as before somehow? |

2020-04-26 21:48:43 +0200 | received badge | ● Scholar (source) |

2020-04-24 09:39:58 +0200 | commented answer | Projection along affine hull Perhaps you could complete this answer with the code to obtain P? |

2020-04-23 09:57:24 +0200 | commented question | Memory leak in Polyhedron? This memory leak in Polyhedron is fixed in this ticket. |

2020-04-23 09:48:39 +0200 | commented answer | Compute the centroid of a polytope ... which will be accessible with the command |

2020-04-23 09:43:49 +0200 | commented answer | plotting 5,8,16,24,120 and 600-cells The 120-cell is now available in the library. The |

2020-04-09 09:02:16 +0200 | received badge | ● Good Answer (source) |

2020-04-08 19:20:21 +0200 | received badge | ● Nice Answer (source) |

2020-04-08 17:08:58 +0200 | answered a question | PolyhedronFace In sage 9.0, I can execute: Which version of sage are you using? That might be a problem as the function |

2020-03-01 11:43:48 +0200 | commented answer | Find sphere points in a lattice I see. If it is in Sage I would suspect that it is closer to the number theory and quadratic forms code, but I am not aware of it... |

2020-02-13 10:30:16 +0200 | answered a question | looping of equality function Defining You do not need to declare the variables if you use them in a range: You can also use more advanced iterators and shorten the code: |

2020-02-11 08:35:23 +0200 | received badge | ● Good Answer (source) |

2020-02-10 22:30:56 +0200 | received badge | ● Nice Answer (source) |

2020-02-10 19:00:08 +0200 | answered a question | Find sphere points in a lattice Here is a snippet of code that should do: You will get a set The norm squared seem to deliver the same as the symmetric form: |

2020-02-10 13:47:43 +0200 | answered a question | VoronoiDiagram returns empty regions This looks like a bug. I have reported it on trac: ticket 29176 Thanks for reporting this! |

2020-02-10 13:41:12 +0200 | answered a question | Typo in Sage documentation (no. 2) This is now a ticket: ticket 29175 |

2020-02-07 19:08:19 +0200 | commented answer | Intersection of a Cube with two planes and resulting polyhedron In a more recent version you can do: |

2020-02-07 18:59:29 +0200 | commented question | hyperplane arrangements raises error on regions I would also try to use rational numbers instead of floats, this might facilitate the computations. You probably do not need floats, as the size of the input is reasonable. say |

2020-02-07 18:52:55 +0200 | commented question | Find sphere points in a lattice Could you explain what is meant by "canonical bilinear form", the one coming from the geometric representation? This will affect how to give you a better answer. |

2020-02-07 18:44:42 +0200 | commented question | Sage notebook only runs when a browser is already open With the notebook, it is also useful to restart the browser once in a while if an update was made (I rarely restart my browser and I was getting similar problems with start-up, restarting the browser did the thing...) Maybe try with have a freshly updated firefox, that does not run, and moving the .sage folder to another location and then so what happens? |

2020-01-09 22:33:56 +0200 | received badge | ● Nice Answer (source) |

2020-01-08 17:41:03 +0200 | answered a question | Lattices via sage Here is a first attempt to answer your questions. 1) The comment should be addressed in order to give an instructive answer. 2) Assuming you want to consider only _linear_ subspace, the following code does the thing: 3) See https://ask.sagemath.org/question/389... and https://ask.sagemath.org/question/389... |

2020-01-08 13:53:33 +0200 | commented question | Lattices via sage Could you clarify which lattice you mean? A lattice can be a subgroup of the additive group |

2019-10-26 11:49:16 +0200 | commented question | LattE problem: Executable 'count' not found on PATH. I also get 39 for the command As mentioned in the documentation obtained by typing I suspect that you are interested in the Ehrhart polynomial. It is important to know that counting the lattice points in a lattice polytope and obtaining the Ehrhart polynomial are two completely different tasks, although they are obviously related. |

2019-10-26 00:19:36 +0200 | commented answer | How to find the vertices a a polyhedron define by inequalities , It is also possible to get the full V-representation using the |

2019-10-26 00:17:43 +0200 | answered a question | Computing projection of a polyhedron One possibility is the following. First create the desired transformation as a matrix. Then, create your polyhedron One then just need to apply the transformation on each vertices of the polyhedron and take the result back to a polyhedron. Currently, projections (or other linear transformations) are not implemented better than as above... |

2019-10-25 20:12:07 +0200 | answered a question | About algorithm for testing whether a point is in a V-polyhedron You can access the algorithm for containment by doing the following: This will show you the source code for this function. The containment check is independent of the backend. Currently, when you create a polyhedron object in Sage, it computes the other representation (H- to V-, or V- to H-) automatically (this may change in the future, but for now, it is so). Then, checking containment is obtained directly from the H-representation by matrix multiplication and checking the equality or inequality of There is absolutely no difference between bounded vs unbounded polyhedron. To know if the function depends on the backend, you can look next to the 1-to-last line in the output of |

2019-09-14 07:56:10 +0200 | commented answer | jmol stuck at "Initializing 3D display" Thanks! That explains why it was stuck indeed. I did create a dummy worksheet to execute my snippet of code and jsmol does work inside jupyter notebooks. |

2019-09-12 10:49:13 +0200 | asked a question | jmol stuck at "Initializing 3D display" I have a freshly compiled version of sage 8.9.rc0. jmol used to work fine until I got it stuck at "Initializing 3D display" The pop out window opens and then is stuck for eternity. This is annoying. I know that I could use a different viewer like (I also upgraded my debian from stretch to buster, but I do not think it is the problem since jmol starts fine outside of sage) How to fix this? |

2019-08-29 10:29:23 +0200 | received badge | ● Good Answer (source) |

2019-08-29 10:28:22 +0200 | received badge | ● Nice Answer (source) |

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.