The universality of Hom complexes

Simple homotopy types of independence complexes of graphs involving grid graphs

We show that if a graph $G$ involves a certain square grid graph as a full subgraph, then a certain operation on it yields a simplicial suspension of the independence complex of $G$. This generalizes a result of Csorba. As a corollary, we determine the simple homotopy types of the independence complexes of some grid graphs.

Homotopy Type of Independence Complexes of Certain Families of Graphs

We show that the independence complexes of generalised Mycielskian of complete graphs are homotopy equivalent to a wedge sum of spheres, and determine the number of copies and the dimensions of these spheres. We also prove that the independence complexes of categorical product of complete graphs are wedge sum of circles, upto homotopy. Further, we show that if we perturb a graph $G$ in a certain way, then the independence complex of this new graph is homotopy equivalent to the suspension of the independence complex of $G$.

Parallel transport of $Hom$-complexes and the Lovasz conjecture

The groupoid of projectivities, introduced by M. Joswig, serves as a basis for a construction of parallel transport of graph and more general $Hom$-complexes. In this framework we develop a general conceptual approach to the Lovasz Hom-conjecture, recently resolved by E. Babson and D. Kozlov, and extend their result from graphs to simplicial complexes. The paper also provides new evidence that the language and methods of groupoids, after being successfully tested in other major mathematical fields, offer new insights and perspectives for combinatorial applications.

离散Morse复形之间的连通性同态

The Connectedness Homomorphism between Discrete Morse Complexes

本研究提出离散Morse复形间的连通性同态概念，构建了链复形层面研究离散Morse理论连通性的新框架，可描述Morse复形尖点退化的离散类比，并完成了光滑与离散情形的精确对比。

有向图的同态复形、重配置与同伦

Homomorphism complexes, reconfiguration, and homotopy for directed graphs

本文系统建立有向图 Hom 复形理论，研究其拓扑性质、图运算、邻域复形、同调消没及同态重配置，并定义相关有向同伦。

Higher Independence Complexes of graphs and their homotopy types

For $r\geq 1$, the $r$-independence complex of a graph $G$ is a simplicial complex whose faces are subset $I \subseteq V(G)$ such that each component of the induced subgraph $G[I]$ has at most $r$ vertices. In this article, we determine the homotopy type of $r$-independence complexes of certain families of graphs including complete $s$-partite graphs, fully whiskered graphs, cycle graphs and perfect $m$-ary trees. In each case, these complexes are either homotopic to a wedge of equi-dimensional spheres or are contractible. We also give a closed form formula for their homotopy types.

A simple proof for folds on both sides in complexes of graph homomorphisms

In this paper we study implications of folds in both parameters of Lovász' Hom(-,-) complexes. There is an important connection between the topological properties of these complexes and lower bounds for chromatic numbers. We give a very short and conceptual proof of the fact that if G-v is a fold of G, then Bd(Hom(G,H)) collapses onto Bd Hom(G-v,H), whereas Hom(H,G) collapses onto Hom(H,G-v). We also give an easy inductive proof of the only nonelementary fact which we use for our arguments: if $ϕ$ is a closure operator on P, then $Δ(P)$ collapses onto $Δ(ϕ(P))$.

On the homotopy and strong homotopy type of complexes of discrete Morse functions

In this paper, we determine the homotopy type of the Morse complex of certain collections of simplicial complexes by studying dominating vertices or strong collapses. We show that if $K$ contains two leaves that share a common vertex, then the Morse complex is strongly collapsible and hence has the homotopy type of a point. We also show that the pure Morse complex of a tree is strongly collapsible, thereby recovering as a corollary a result of Ayala et al. In addition, we prove that the Morse complex of a disjoint union $K\sqcup L$ is the Morse complex of the join $K*L$. This result is used to…

Homomorphism Complexes and k-Cores

We prove that the topological connectivity of a graph homomorphism complex Hom($G,K_m$) is at least $m-D(G)-2$, where $\displaystyle D(G)=\max_{H\subseteq G}δ(H)$. This is a strong generalization of a theorem of Cukić and Kozlov, in which $D(G)$ is replaced by the maximum degree $Δ(G)$. It also generalizes the graph theoretic bound for chromatic number, $\displaystyleχ(G)\leq D(G)+1$, as $\displaystyleχ(G)=\min\{ m:\text{Hom}(G,K_m)\neq\varnothing\}$. Furthermore, we use this result to examine homological phase transitions in the random polyhedral complexes Hom$(G(n,p),K_m)$ when $p=c/n$ for a…

支配复形、邻域复形与组合Alexander对偶

Dominance complexes, neighborhood complexes and combinatorial Alexander duals

该研究揭示图的支配复形与补图邻域复形的组合Alexander对偶的一致性，建立色数与支配复形同调群的关联，提出用独立复形计算支配复形同调群的新方法，并确定了特定网格图支配复形的同调群。

平方循环图的全割复形的同伦型

Homotopy Type of Total Cut Complexes of Squared Cycle Graphs

本文研究了平方循环图的全割复形的同伦型，证明了Bayer等人对k=3时的猜想，并确认了n=3k+1和3k+2的一般情形。

Hom complexes and homotopy theory in the category of graphs

We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological properties of the $\Hom$ complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; $\Hom$ complexes were introduced by Lovász and further studied by Babson and Kozlov to give topological bounds on chromatic number. Along the way, we also establish some structural properties of $\Hom$ complexes involving products and exponentia…

On the homology of independence complexes

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double complex with trivial homology. Filtering this double complex in the right direction induces a spectral sequence that converges to zero and contains on its first page the homology of the independence complexes of $G$ and various subgraphs of $G$, obtained by removing independent sets and their neighborhoods from $G$. It is shown that this spectral sequence may be u…

Morphism complexes of sets with relations

Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were introduced for graphs in the context of the graph coloring problem. In the first part, we introduce simplicial sets which we call singular complexes, and show that singular complexes and Hom complexes are naturally homotopy equivalent. The second part is devoted to the generalization of $\times$-homotopy theory established by Dochtermann. We show the folding theor…

WI-posets, graph complexes and Z_2-equivalences

We introduce WI-posets as intermediate objects in the study of Z_2-homotopy types of graph complexes. It turns out that (almost) all graph complexes associated to a graph can be viewed as avatars of the same object, as long as their Z_2-homotopy types are concerned. Among the applications are a proof that each finite, free Z_2-complex is a graph complex and an evaluation of Z_2-homotopy types of complexes Ind(C_n) of independence sets in a cycle C_n. The main tools used in the paper are Quillen fiber theorem and Bredon criterion for Z_2-equivalence of Z_2-complexes.

Independence complexes of $(n \times 6)$-grid graphs

We determine the homotopy types of the independence complexes of the $(n \times 6)$-square grid graphs. In fact, we show that these complexes are homotopy equivalent to wedges of spheres.

On the homotopy type of multipath complexes

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated generating function, of the multipath complex for some families of graphs, including transitive tournaments and complete bipartite graphs. Then, we compute the homotopy type of multipath complexes of linear graphs, polygons, small grids and transitive tournaments. We show that they are all contractible or wedges of spheres. We introduce a new technique for deco…

广义Mycielskian图的独立复形

Independence complexes of generalized Mycielskian graphs

研究广义Mycielskian图的独立复形同调类型，通过图G和其Kronecker双覆盖图的同调类型确定，并应用于路径、环和完全图积的同调类型计算。

Homotopy types of Hom complexes of graphs

The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the chromatic number of $G$. For a fixed finite graph $T$, we show that there is no homotopy invariant of ${\rm Hom}(T,G)$ which gives an upper bound for the chromatic number of $G$. More precisely, for a non-bipartite graph $G$, we construct a graph $H$ such that ${\rm Hom}(T,G)$ and ${\rm Hom}(T,H)$ are homotopy equivalent but $χ(H)$ is much larger than $χ(G)$. Th…

Homomorphism Complexes and Maximal Chains in Graded Posets

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special emphasis on finite products of chains. For the special case of a Boolean algebra, we observe that the corresponding homomorphism complex is isomorphic to the subcomplex of cubical cells in a permutahedron. Thus, this work can be interpreted as a generalization of the study of these complexes. We provide a detailed investigation when our poset is a product of…

Box complexes and homotopy theory of graphs

We introduce a model structure on the category of graphs, which is Quillen equivalent to the category of $\mathbb{Z}_2$-spaces. A weak equivalence is a graph homomorphism which induces a $\mathbb{Z}_2$-homotopy equivalence between their box complexes. The box complex is a $\mathbb{Z}_2$-space associated to a graph, considered in the context of the graph coloring problem. In the proof, we discuss the universality problem of the Hom complex.

On the homeomorphism and homotopy type of complexes of multichains

In this paper we define and study for a finite partially ordered set P a class of simplicial complexes on the set P_r of r-element multichains from P. The simplicial complexes depend on a strictly monotone function from [r] to [2r]. We show that there exactly 2^r such functions which yield subdivisions of the order complex of P of which 2^{r-1} are pairwise different. Within this class are for example the order complexes of the interval and the zig-zag poset of P and the rth edgewise subdivision of the order complex of P. We also exhibit a large subclass for which our simplicial complexes are …

Homotopy type of the independence complexes of a family of regular bipartite graphs

In this article, we define a family of regular bipartite graphs and show that the homotopy type of the independence complexes of this family is the wedge sum of spheres of certain dimensions.

Top homology of hypergraph matching complexes, $p$-cycle complexes and Quillen complexes of symmetric groups

We investigate the representation of a symmetric group $S_n$ on the homology of its Quillen complex at a prime $p$. For homology groups in small codimension, we derive an explicit formula for this representation in terms of the representations of symmetric groups on homology groups of $p$-uniform hypergraph matching complexes. We conjecture an explicit formula for the representation of $S_n$ on the top homology group of the corresponding hypergraph matching complex when $n \equiv 1 \bmod p$. Our conjecture follows from work of Bouc when $p=2$, and we prove the conjecture when $p=3$.

Integral homology of random simplicial complexes

The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as $n\to\infty$, the first homology group over $\mathbb Z$ vanishes at the very moment when all the edges are covered by triangular faces.

Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes

The Linial-Meshulam complex model is a natural higher-dimensional analog of the Erdős-Rényi graph model. In recent years, Linial and Peled established a limit theorem for Betti numbers of Linial-Meshulam complexes with an appropriate scaling of the underlying parameter. The present paper aims to extend that result to more-general random simplicial complex models. We introduce a class of homogeneous and spatially independent random simplicial complexes, including the Linial-Meshulam complex model and the random clique complex model as special cases, and we study the asymptotic behavior of their…

The threshold for integer homology in random d-complexes

Let Y ~ Y_d(n,p) denote the Bernoulli random d-dimensional simplicial complex. We answer a question of Linial and Meshulam from 2003, showing that the threshold for vanishing of homology H_{d-1}(Y; Z) is less than 80d log n / n. This bound is tight, up to a constant factor.

Frobenius complexes and the homotopy colimit of a diagram of posets over a poset

An affine monoid is an additive monoid which is cancellative, pointed and finitely generated. An affine monoid $Λ$ has the partial order defined by $λ\le λ+ μ$. The Frobenius complex is the order complex of an open interval of $Λ$ with respect to this partial order. The reduced homology of the Frobenius complex is related to the torsion group of the monoid algebra $K[Λ]$. In this paper, we pay attention to homotopy types of Frobenius complexes, and we express the homotopy types of the Frobenius complexes of $Λ$ in terms of those of $Λ_1$ and $Λ_2$ when $Λ$ is an affine monoid obtained by gluin…

图的幅度同调与 Asao-Izumihara 复形上的离散 Morse 理论

Magnitude homology of graphs and discrete Morse theory on Asao-Izumihara complexes

本文研究 Asao-Izumihara 复形的同伦型与图幅度同调可对角化性的关系，证明 pawful 图的该复形同伦等价于球面的一点并，并推广 pawful 图概念，找到新的直径为 2 的非 pawful 可对角化图。

Homological Connectivity in Random Čech Complexes

We study the homology of random Čech complexes generated by a homogeneous Poisson process. We focus on 'homological connectivity' - the stage where the random complex is dense enough, so that its homology "stabilizes" and becomes isomorphic to that of the underlying topological space. Our results form a comprehensive high-dimensional analogue of well-known phenomena related to connectivity in the Erdős-Rényi graph and random geometric graphs. We first prove that there is a sharp phase transition describing homological connectivity. Next, we analyze the behavior of the complex in the critical w…

有限分次偏序集的滤子序复形和量值同调

Filtered order complexes and magnitude homology of finite graded posets

研究通过秩函数定义的分次偏序集序复形的子复形族，探讨其拓扑性质与量值同调的关系，证明闭流形剖分和可壳复形的同调性质，以及几何半格中复形同伦等价于球面楔和。

One-point reductions of finite spaces, h-regular CW-complexes and collapsibility

We investigate one-point reduction methods of finite topological spaces. These methods allow one to study homotopy theory of cell complexes by means of elementary moves of their finite models. We also introduce the notion of h-regular CW-complex, generalizing the concept of regular CW-complex, and prove that the h-regular CW-complexes, which are a sort of combinatorial-up-to-homotopy objects, are modeled (up to homotopy) by their associated finite spaces. This is accomplished by generalizing a classical result of McCord on simplicial complexes.

The homotopy type of complexes of graph homomorphisms between cycles

In this paper we study the homotopy type of $\Hom(C_m,C_n)$, where $C_k$ is the cyclic graph with $k$ vertices. We enumerate connected components of $\Hom(C_m,C_n)$ and show that each such component is either homeomorphic to a point or homotopy equivalent to $S^1$. Moreover, we prove that $\Hom(C_m,L_n)$ is either empty or is homotopy equivalent to the union of two points, where $L_n$ is an $n$-string, i.e., a tree with $n$ vertices and no branching points.

Homology of balanced complexes via the Fourier transform

Let G_0,...,G_k be finite abelian groups and let G_0*...*G_k be the join of the 0-dimensional complexes G_i. We give a characterization of the integral k-coboundaries of subcomplexes of G_0*...*G_k in terms of the Fourier transform on the group G_0 \times ... \times G_k. This leads to an extension of a recent result of Musiker and Reiner on a topological interpretation of the cyclotomic polynomial.

Dissections, Hom-complexes and the Cayley trick

We show that certain canonical realizations of the complexes Hom(G,H) and Hom_+(G,H) of (partial) graph homomorphisms studied by Babson and Kozlov are in fact instances of the polyhedral Cayley trick. For G a complete graph, we then characterize when a canonical projection of these complexes is itself again a complex, and exhibit several well-known objects that arise as cells or subcomplexes of such projected Hom-complexes: the dissections of a convex polygon into k-gons, Postnikov's generalized permutohedra, staircase triangulations, the complex dual to the lower faces of a cyclic polytope, a…

Random Čech Complexes on Riemannian Manifolds

In this paper we study the homology of a random Cech complex generated by a homogeneous Poisson process in a compact Riemannian manifold M. In particular, we focus on the phase transition for "homological connectivity" where the homology of the complex becomes isomorphic to that of M. The results presented in this paper are an important generalization of [7], from the flat torus to general compact Riemannian manifolds. In addition to proving the statements related to homological connectivity, the methods we develop in this paper can be used as a framework for translating results for random geo…

双向多边形有向图的多路径复形

Multipath complexes of bidirectional polygonal digraphs

本文研究了双向多边形有向图的多路径复形的同调类型及其连通性，通过谱序列计算同调群，并探讨了复形的可壳性性质。

Enriched homology and cohomology modules of simplicial complexes

For a simplicial complex X on {1,2, ..., n} we define enriched homology and cohomology modules. They are graded modules over k[x_1, ..., x_n] whose ranks are equal to the dimensions of the reduced homology and cohomology groups. We characterize Cohen-Macaulay, l-Cohen-Macaulay, Buchsbaum, and Gorenstein* complexes X, and also orientable manifolds in terms of the enriched modules. We introduce the notion of girth for simplicial complexes and make a conjecture relating the girth to invariants of the simplicial complex. We also put strong vanishing conditions on the enriched homology modules and …

Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups

In this paper, we investigate a relation between finite graphs, simplicial flag complexes and right-angled Coxeter groups, and we provide a class of reconstructible finite graphs. We show that if $Γ$ is a finite graph which is the 1-skeleton of some simplicial flag complex $L$ which is a homology manifold of dimension $n \ge 1$, then the graph $Γ$ is reconstructible.

偏序集的拓扑展开与随机q-复形的同调k-连通性

Topological expansion for posets and the homological $k$-connectivity of random $q$-complexes

本文针对超越单纯复形的高维展开问题，开发了新的拓扑技术，证明完全q-复形的相关性质，建立随机q-复形连通性的尖锐阈值，还解决了一项同调猜想。