forked from Macaulay2/M2
-
Notifications
You must be signed in to change notification settings - Fork 0
K Decomposability_of_Simplicial_Complexes
Mahrud Sayrafi edited this page Mar 12, 2021
·
1 revision
title: K-Decomposability of Simplicial Complexes permalink: wiki/K-Decomposability_of_Simplicial_Complexes/ layout: wiki
The working file is [trunk/M2/Macaulay2/packages/development/msri2010/SimplicialDecomposability.m2] on the SVN repository.
- Compute a shelling order of a shellable simplicial complex.
- Compute whether or not a simplicial complex is shellable.
- Compute whether or not a simplicial complex is vertex-decomposable.
- Compute whether or not a pure simplicial complex is k-decomposable.
isShelling: actually determine if it is a shelling.shellingOrder: actually find a shelling order-
Add tests for isShelling, isSimplex, hVector, isShellable. Add the more general k-decomposability routine.Add tests for the k-decomposability routines.shellingOrder: Add other Strategies beyond "Naive".-
Implement not-necessarily-pure versions of:iskDecomposableisSheddingFaceisShellableisShellingisVertexDecomposableshellingOrder
Thorough testingCache shelling orderAdd fTriangle and hTriangle routines- Optimise the code -- Always needed!
-
Home
- Introduction
- Macaulay2 Contribution Guides
- Macaulay2 Workshop Guides
-
Macaulay2 Internals
- Building Macaulay2 from source
- Components of Macaulay2
- Case Studies
- Web servers
- Other
- Frequently Asked Questions
- Road map