Related papers: Dowker Complexes and filtrations on self-relations

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…

A map $f:X\to Y$ to a simplicial complex $Y$ is called a $Y$-triangular homotopy equivalence if it has a homotopy inverse $g$ and homotopies $h_1:f\circ g\simeq \mathrm{id}_Y$, $h_2:g\circ f\simeq \mathrm{id}_X$ such that for all simplices…

We define two different simplicial complexes, the common divisor simplicial complex and the prime divisor simplicial complex, from a set of integers, and explore their similarities. We will define a map between the two simplicial complexes,…

Methods are developed to relate the action of a principal fibration to relative Whitehead products in order to determine the homotopy type of certain spaces. The methods are applied to thoroughly analyze the homotopy type of the based loops…

We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests…

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

Given any model category, or more generally any category with weak equivalences, its simplicial localization is a simplicial category which can rightfully be called the "homotopy theory" of the model category. There is a model category…

The matching complex of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. In the last few years the matching complexes of grid graphs have gained much attention among the topological combinatorists. In 2017, Braun…

In [Discrete differential calculus on simplicial complexes and constrained homology, Chin. Ann. Math. Ser. B 44(4), 615-640, 2023], the constrained (co)homology for simplicial complexes and independence hypergraphs is constructed via…

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…

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

For a finite simplicial complex K and a CW-pair (X,A), there is an associated CW-complex Z_K(X,A), known as a polyhedral product. We apply discrete Morse theory to a particular CW-structure on the n-sphere moment-angle complexes Z_K(D^{n},…

We introduce a new `geometric realization' of an (abstract) simplicial complex, inspired by probability theory. This space (and its completion) is a metric space, which has the right (weak) homotopy type, and which can be compared with the…

We study the dual complexes of boundary divisors in log resolutions of compactifications of algebraic varieties and show that the homotopy types of these complexes are independent of all choices. Inspired by recent developments in…

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…

We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral…

For a Kan complex with a vertex, we have the notion of its simplicial homotopy groups. In this paper, for a weak complicial set in the sense of Verity with a vertex, we construct monoids which are a generalization of simplicial homotopy…