Implementation of Cohen-Macaulay test for simplicial complexes
|Reported by:||stumpc5||Owned by:||malb|
|Component:||commutative algebra||Keywords:||Cohen-Macaulay, homology, simplicial complexes|
|Authors:||Christian Stump||Reviewers:||Travis Scrimshaw|
|Report Upstream:||N/A||Work issues:|
Description (last modified by )
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_subcomplex has become faster.
For convinience, I also added a face_iterator.
Remark: the new line
int_facets = set( a.set().intersection(f_set) for a in new_facets )
in _enalarge_subcomplex improved speed for computing the homology by 65% (in the example I looked at -- needs to be verified). This method still has the potential to be speeded a lot, and it is responsible for a lot cpu time when computing the homology.
I also added a second version using parallel tests on multiple cpus.
Change History (19)
Changed 4 years ago by
comment:14 follow-up: ↓ 15 Changed 4 years ago by
- Dependencies set to #12587
- Description modified (diff)
- Reviewers set to Travis Scrimshaw
comment:15 in reply to: ↑ 14 Changed 4 years ago by
- Status changed from needs_review to positive_review
comment:17 in reply to: ↑ 4 Changed 4 years ago by
- Work issues further improvement of _enlarge_subcomplex deleted