Deciding Shellability of Simplicial Complexes with h-Assignments
スポンサーリンク
概要
- 論文の詳細を見る
If a d-dimensional pure simplicial complex C has a shelling, which is a specific total order of all facets of C, C is said to be shellable. We consider the problem of deciding whether C is shellable or not. This problem is solved in linear time of m, the number of all facets of C, if d=1 or C is a pseudomanifold in d=2. Otherwise it is unknown at this point whether the decision of shellability can be solved in polynomial time of m. Thus, for the latter case, we had no choice but to apply a brute force method to the decision problem; namely checking up to the m! ways to see if one can arrange all the m facets of C into a shelling. In this paper, we introduce a new concept, called h-assignment, to C and propose a practical method using h-assignments to decide whether C is shellable or not. Our method can make the decision of shellability of C by smaller sized computation than the brute force method.
論文 | ランダム
- Utility of Generalized Hazards Model Incorporating Cubic B-spline Function into the Baseline Hazard Function
- Ensemble Average and Variance of a Stochastic Spiking Neuron Model
- 九州風土記の成立をめぐって
- 『海部氏勘注系図』所引の風土記関係記事をめぐって
- Fabrication of Niobium Weak Links by Means of Electron Beam Lithography and Ion Implantation : C-1: JOSEPHSON DEVICES