-
It would be good to have a method to compute the automorphism group of a simplicial complex.
This patch implements that.
And also a procedure to check wether two simplicial complexes are isomorphi…
-
Random simplicial complexes don't have the right number of vertices. From the doctests:
```
sage: simplicial_complexes.RandomComplex(6, 2)
Simplicial complex with vertex set…
-
`polyhedral_complex` creates a geometric polyhedral complex corresponding to the triangulation.
`boundary_simplicial_complex` and `boundary_polyhedral_complex` are combinations of `boundary` (which…
-
Add functionality in sage to compute the cohomology ring of a simplicial complex.
This relies on #6099, #6100, and #5882.
These will be examples of graded alebras, finite as modules over their bas…
-
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…
-
Simplicial complexes are lacking a proper hash function. See the example below.
```
sage: S = SimplicialComplex([[]]); S
Simplicial complex with vertex set () and facets {()}
sage: hash(S)
-3899221…
-
微博内容精选
-
This in some sense a followup to #6102 and in some sense a precursor for a future ticket for simplicial sets. This mainly involves some reorganization, not much new.
- Add a `reduced` keyword to th…
-
After #12587, one could make simplicial complexes immutable in order for them to be hashable. However there was no functionality to make mutable copies.
CC: @jhpalmieri
Component: **algebraic top…
-
This is a followup to #6100, and was reported on [this ask question](https://ask.sagemath.org/question/54070/generators-of-simplicial-homology/). If `K` is a simplicial complex, the `generators` arg…