Related papers: Spheres and balls as independence complexes
Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…
We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…
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…
The construction of the Bier sphere Bier(K) for a simplicial complex K is due to Bier. Bj\"orner, Paffenholz, Sj\"ostrand and Ziegler generalize this construction to obtain a Bier poset Bier(P,I) from any bounded poset P and any proper…
To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…
Chudnovsky, Scott, Seymour and Spirkl recently proved a conjecture by Kalai and Meshulam stating that the reduced Euler characteristic of the independence complex of a graph without induced cycles of length divisible by three is in…
By an independent set in a simple graph $G$, we mean a set of pairwise non-adjacent vertices in $G$. The independence polynomial of $G$ is defined as $I_G(z)=a_0 + a_1 z + a_2 z^2+\cdots+a_\alpha z^{\alpha}$, where $a_i$ is the number of…
We prove that the simplicial complex whose simplices are the nonempty partial bases of $\mathbb{F}_n$ is homotopy equivalent to a wedge of $(n-1)$-spheres. Moreover, we show that it is Cohen-Macaulay.
We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…
A notion of an $i$-banner simplicial complex is introduced. For various values of $i$, these complexes interpolate between the class of flag complexes and the class of all simplicial complexes. Examples of simplicial spheres of an arbitrary…
In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
This paper aims to derive a definition of complexity for a dynamic spherical system in the background of self-interacting Brans-Dicke gravity. We measure complexity of the structure in terms of inhomogeneous energy density, anisotropic…
A theorem of Furuta and Fintushel-Stern provides a criterion for a collection of Seifert fibred homology spheres to be independent in the homology cobordism group of oriented homology 3-spheres. In this article we use these results and some…
We construct a new graph on 120 vertices whose quantum and classical independence numbers are different. At the same time, we construct an infinite family of graphs whose quantum chromatic numbers are smaller than the classical chromatic…
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We…
For every finite graph $\Gamma$, we define a simplicial complex associated to the outer automorphism group of the RAAG $A_\Gamma$. These complexes are defined as coset complexes of parabolic subgroups of $Out^0(A_\Gamma)$ and interpolate…
It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of…
With a view toward studying the homotopy type of spaces of Boolean formulae, we introduce a simplicial complex, called the theta complex, associated to any hypergraph, which is the Alexander dual of the more well-known independence complex.…
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…