Network realignment complexes
The author introduces a new family of combinatorial complexes \(\{X_n\}_{n\geq 1}\). Each complex \(X_n\) models the process of updating spanning tree networks on \(n\) vertices over time, and it is given by the cubical structure on the geometric realization \(\vert \Delta (P_n)\vert\), where \(P_n\) denotes the poset defined by using the notion of network realignment and \(\Delta (P_n)\) denotes its ordered complex. In this paper, the author proves that there exists a strong deformation retraction from the complex \(X_n\) to the complete graph \(K_n\) of \(n\) vertices. In particular, he shows that it is homotopy equivalent to a wedge of \((n-1)(n-2)/2\) copies of \(S^1\). The proof is based on discrete Morse theory.
- Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
- Combinatorial algebraic topology
- Complexes of graph homomorphisms
- Computational homology
- Configuration spaces of labeled points on a circle with two anchors
- Cup products and the higher topological complexity of configuration spaces of the circle with two anchored points
- Discrete Morse Theory
- Geometry of the space of phylogenetic trees
- Homology and Euler characteristic of generalized anchored configuration spaces of graphs
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3411897 (Why is no real title available?)
- Morse theory. Smooth and discrete
- Organized collapse. An introduction to discrete Morse theory
- Proof of the Lovász conjecture
- Stirling complexes
This page was built for publication: Network realignment complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7002442)
