-
This ticket includes changes for cell complexes and in general files in `src/sage/homology` for Python 3 compatibility. There are several types of changes:
- make sure data are sorted consistently,…
-
This question https://stackoverflow.com/questions/14106121/efficient-algorithm-for-finding-all-maximal-subsets contains an answer with an efficient python-coded solution. We might want to incorporate …
-
Simplicial complexes have a `remove_face` method for removing a single face.
It might be worth having a `remove_faces` method for removing several faces at once.
See sage-devel discussion:
- https…
-
The current implementation to compute minimal non-faces of simplicial complexes is really slow:
```
sage: SC = SimplicialComplex([(0,1,2),
(0,2,3),
(2,3,4),
(1,2,4),
(1,4,5),
(0,3,6),
(3,6,7)…
-
Simplicial complexes were lacking a method to test Cohen-Macaulayness.
In order to implement this method, some other methods are improved, namely a hash function is implemented, and _enlarge_subcom…
-
The attached patch adds lots of functionality to Sage's algebraic topology capabilities:
- it implements cubical complexes: complexes constructed from cubes of various dimensions, glued together in…
-
Since each of the examples are unique, there should only be one (immutable) instance of each. In other words, we do not recreate the example each time it is called. For example
```
sage: S1 = simpl…
-
The `add_face` method currently deletes the `__enlarged` cache, but this is unnecessary.
CC: @tscrim
Component: **algebraic topology**
Keywords: **days74**
Author: **John Palmieri**
Branch/Com…
-
I propose to add to the list of simplicial complexes the minimal triangulation of the K3 surface, which has 16 vertices and 288 facets.
```
sage: simplicial_complexes.K3_surface()
Simplicial comple…
-
This patch adds more examples of simplicial complexes: real projective spaces (that is, RPd for any positive d), CP2, and the Poincare homology sphere. Some of these are the minimal triangulations,…