Closed jhpalmieri closed 5 years ago
Branch: u/jhpalmieri/simplicial-docs
Commit: 15ee788
New commits:
15ee788 | trac 27211: in a simplicial complex, the vertex set is determined |
+ automatically: `V` is defined to be the union of the sets `K`. So
->
+ automatically: `V` is defined to be the union of the sets in `K`. So
===
+simplicial complex, specify its *facets*: the maximal subsets (with
+respect to inclusion) of the vertex set. Each facet can be specifed as
->
+simplicial complex, specify its *facets*: the maximal subsets (with
+respect to inclusion) of the vertex set that belong to `K`. Each facet can be specifed as
===
Other than this, LGTM if the doc compiles (I don't have Sage installed, so I can't check) and if your claim about maximal_faces
being a number is true (is there a doctest?).
Lines 980-981:
sage: SimplicialComplex([2])
Simplicial complex with vertex set (0, 1, 2) and facets {(0, 1, 2)}
Ah, perfect.
Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:
6ae1ee3 | trac 27211: in a simplicial complex, the vertex set is determined |
I made the other changes, too.
Reviewer: Darij Grinberg
LGTM, thanks!
Changed keywords from none to simplicial complex
Changed branch from u/jhpalmieri/simplicial-docs to 6ae1ee3
The documentation for simplicial complexes is outdated: it should say that the vertex set is determined automatically from the facets (as their union).
Component: algebraic topology
Keywords: simplicial complex
Author: John Palmieri
Branch/Commit:
6ae1ee3
Reviewer: Darij Grinberg
Issue created by migration from https://trac.sagemath.org/ticket/27211