Lusternik-Schnirelmann category for simplicial complexes (Q470852): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The authors define Lusternik-Schnirelmann category in simple homotopy type and use it obtain a lower bound for the number of discrete Morse functions. For recall, if \(K\) is a simplicial complex, an elementary collapse is an injection \(K\backslash \{\sigma, \tau\}\to K\) where \(\sigma, \tau\) are faces such that \(\sigma\) is a face of \(\tau\) and \(\sigma\) has no other coface. Then two complexes \(K_1\) and \(K_2\) have the same simple homotopy type if there is a sequence of collapses connecting \(K_1\) to \(K_2\). If \(K_2= \{v\}\) a single vertex, then \(K_1\) is called collapsible. A complex \(K\) has discrete geometric pre-category \(\leq m\) if \(K\) can be covered by \(m+1\) closed collapsible subcomplexes. The discrete geometric category of \(K\), \(\mathrm{dgcat}(K)\), is the minimum of the discrete geometric pre-categories of all the complexes in the same simple homotopy type as \(K\). The authors prove that if \(K\) has \(n\) vertices, then dgcat\((K)\leq n-1\). On the other hand if \(G\) is a planar graph, then dgcat\((G)\leq 2\). The main result says that the number of critical values of a discrete Morse function \(f:K\to \mathbb R\) is \(\geq \mathrm{ dgcat}(K)+1\). | |||
Property / review text: The authors define Lusternik-Schnirelmann category in simple homotopy type and use it obtain a lower bound for the number of discrete Morse functions. For recall, if \(K\) is a simplicial complex, an elementary collapse is an injection \(K\backslash \{\sigma, \tau\}\to K\) where \(\sigma, \tau\) are faces such that \(\sigma\) is a face of \(\tau\) and \(\sigma\) has no other coface. Then two complexes \(K_1\) and \(K_2\) have the same simple homotopy type if there is a sequence of collapses connecting \(K_1\) to \(K_2\). If \(K_2= \{v\}\) a single vertex, then \(K_1\) is called collapsible. A complex \(K\) has discrete geometric pre-category \(\leq m\) if \(K\) can be covered by \(m+1\) closed collapsible subcomplexes. The discrete geometric category of \(K\), \(\mathrm{dgcat}(K)\), is the minimum of the discrete geometric pre-categories of all the complexes in the same simple homotopy type as \(K\). The authors prove that if \(K\) has \(n\) vertices, then dgcat\((K)\leq n-1\). On the other hand if \(G\) is a planar graph, then dgcat\((G)\leq 2\). The main result says that the number of critical values of a discrete Morse function \(f:K\to \mathbb R\) is \(\geq \mathrm{ dgcat}(K)+1\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Yves Félix / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 55M30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 55U05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 57M15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6369188 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Lusternik-Schnirelmann category | |||
Property / zbMATH Keywords: Lusternik-Schnirelmann category / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
simplicial complex | |||
Property / zbMATH Keywords: simplicial complex / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
simple homotopy type | |||
Property / zbMATH Keywords: simple homotopy type / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
discrete Morse function | |||
Property / zbMATH Keywords: discrete Morse function / rank | |||
Normal rank |
Revision as of 17:34, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lusternik-Schnirelmann category for simplicial complexes |
scientific article |
Statements
Lusternik-Schnirelmann category for simplicial complexes (English)
0 references
13 November 2014
0 references
The authors define Lusternik-Schnirelmann category in simple homotopy type and use it obtain a lower bound for the number of discrete Morse functions. For recall, if \(K\) is a simplicial complex, an elementary collapse is an injection \(K\backslash \{\sigma, \tau\}\to K\) where \(\sigma, \tau\) are faces such that \(\sigma\) is a face of \(\tau\) and \(\sigma\) has no other coface. Then two complexes \(K_1\) and \(K_2\) have the same simple homotopy type if there is a sequence of collapses connecting \(K_1\) to \(K_2\). If \(K_2= \{v\}\) a single vertex, then \(K_1\) is called collapsible. A complex \(K\) has discrete geometric pre-category \(\leq m\) if \(K\) can be covered by \(m+1\) closed collapsible subcomplexes. The discrete geometric category of \(K\), \(\mathrm{dgcat}(K)\), is the minimum of the discrete geometric pre-categories of all the complexes in the same simple homotopy type as \(K\). The authors prove that if \(K\) has \(n\) vertices, then dgcat\((K)\leq n-1\). On the other hand if \(G\) is a planar graph, then dgcat\((G)\leq 2\). The main result says that the number of critical values of a discrete Morse function \(f:K\to \mathbb R\) is \(\geq \mathrm{ dgcat}(K)+1\).
0 references
Lusternik-Schnirelmann category
0 references
simplicial complex
0 references
simple homotopy type
0 references
discrete Morse function
0 references