Search arXivSearch

arXiv · 2312.10976

Simple homotopy of flag simplicial complexes and contractible contractions of graphs

Abstract

In his work on molecular spaces, Ivashchenko introduced the notion of an $\mathfrak{I}$-contractible transformation on a graph $G$, a family of addition/deletion operations on its vertices and edges. Chen, Yau, and Yeh used these operations to define the $\mathfrak{I}$-homotopy type of a graph, and showed that $\mathfrak{I}$-contractible transformations preserve the simple homotopy type of $C(G)$, the clique complex of $G$. In other work, Boulet, Fieux, and Jouve introduced the notion of $s$-homotopy of graphs to characterize the simple homotopy type of a flag simplicial complex. They proved that $s$-homotopy preserves $\mathfrak{I}$-homotopy, and asked whether the converse holds. In this note, we answer their question in the affirmative, concluding that graphs $G$ and $H$ are $\mathfrak{I}$-homotopy equivalent if and only if $C(G)$ and $C(H)$ are simple homotopy equivalent. We also show that a finite graph $G$ is $\mathfrak{I}$-contractible if and only if $C(G)$ is contractible, which answers a question posed by the first author, Espinoza, Frías-Armenta, and Hernández. We use these ideas to give a characterization of simple homotopy for arbitrary simplicial complexes in terms of links of vertices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Dochtermann, Takahiro Matsushita. 2025-03-05. Simple homotopy of flag simplicial complexes and contractible contractions of graphs. https://arxiv.org/abs/2312.10976

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO