Collapsing along monotone poset maps
Dmitry N. Kozlov
Abstract
We introduce the notion of nonevasive reduction, and show that for any monotone poset map ϕ:P P, the simplicial complex Δ(P) NE-reduces to Δ(Q), for any Q⊃eq Fixϕ. As a corollary, we prove that for any order-preserving map ϕ:P P satisfying ϕ(x)≥ x, for any x∈ P, the simplicial complex Δ(P) collapses to Δ(ϕ(P)). We also obtain a generalization of Crapo's closure theorem.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.