Estimating the discrete Lusternik-Schnirelmann category
DOI:
https://doi.org/10.12775/TMNA.2015.006Keywords
Lusternik-Schnirelmann category, computational topology, collapse, simplicial complexAbstract
Let $K$ be a simplicial complex and suppose that $K$ collapses onto $L$. Define $n$ to be $1$ less than the minimum number of collapsible sets it takes to cover $L$. Then the discrete geometric Lusternik-Schnirelmann category of $K$ is the smallest $n$ taken over all such $L$. In this paper, we give an algorithm which yields an upper bound for the discrete geometric category. We show our algorithm is correct and give several bounds for the discrete geometric category of well-known simplicial complexes. We show that the discrete geometric category of the dunce cap is $2$, implying that the dunce cap is ``further" from being collapsible than Bing's house whose discrete geometric category is $1$.Downloads
Published
2015-03-01
How to Cite
1.
GREEN, Brian, TSURUGA, Mimi and SCOVILLE, Nicholas A. Estimating the discrete Lusternik-Schnirelmann category. Topological Methods in Nonlinear Analysis. Online. 1 March 2015. Vol. 45, no. 1, pp. 103 - 116. [Accessed 13 December 2024]. DOI 10.12775/TMNA.2015.006.
Issue
Section
Articles
Stats
Number of views and downloads: 0
Number of citations: 1