Morse and Lusternik-Schnirelmann for graphs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916265767993344 |
|---|---|
| author | Knill, Oliver |
| author_facet | Knill, Oliver |
| contents | Both Morse theory and Lusternik-Schnirelmann theory link algebra, topology and analysis in a geometric setting. The two theories can be formulated in finite geometries like graph theory or within finite abstract simplicial complexes. We work here mostly in graph theory and review the Morse inequalities b(k)-b(k-1) + ... + b(0) less of equal than c(k)-c(k-1) + ... + c(0) for the Betti numbers b(k) and the minimal number c(k) of Morse critical points of index k and the Lusternik-Schnirelmann inequalities cup+1 less or equal than cat less or equal than cri, between the algebraic cup length cup, the topological category cat and the analytic number cri counting the minimal number of critical points of a function. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_19603 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Morse and Lusternik-Schnirelmann for graphs Knill, Oliver Combinatorics Discrete Mathematics 57M15, 68R10, 55U10, 05Exx 57M15, 68R10, 55U10, 05Exx 57M15, 68R10, 55U10, 05Exx Both Morse theory and Lusternik-Schnirelmann theory link algebra, topology and analysis in a geometric setting. The two theories can be formulated in finite geometries like graph theory or within finite abstract simplicial complexes. We work here mostly in graph theory and review the Morse inequalities b(k)-b(k-1) + ... + b(0) less of equal than c(k)-c(k-1) + ... + c(0) for the Betti numbers b(k) and the minimal number c(k) of Morse critical points of index k and the Lusternik-Schnirelmann inequalities cup+1 less or equal than cat less or equal than cri, between the algebraic cup length cup, the topological category cat and the analytic number cri counting the minimal number of critical points of a function. |
| title | Morse and Lusternik-Schnirelmann for graphs |
| topic | Combinatorics Discrete Mathematics 57M15, 68R10, 55U10, 05Exx 57M15, 68R10, 55U10, 05Exx 57M15, 68R10, 55U10, 05Exx |
| url | https://arxiv.org/abs/2405.19603 |