Simplicial simple-homotopy of flag complexes in terms of graphs
Romain Boulet, Etienne Fieux, Bertrand Jouve
备注：
15 pages, 8 figures (in tex format; uses pstricks). In version v2, the hypothesis of the Lemma 4.4 was incomplete. This has been corrected in version v3 and, as a consequence, Proposition 4.5 states only an implication and not an equivalence. These corrections are the subject of the erratum https://doi.org/10.1016/j.ejc.2019.05.004 in European Journal of Combinatorics
发表信息：
European Journal of Combinatorics, doi:10.1016/j.ejc.2009.05.003 and doi:10.1016/j.ejc.2019.05.004
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type of a graph and show in particular that two finite graphs have the same s-homotopy type if, and only if, the two flag complexes determined by these graphs have the same simplicial simple-homotopy type (Theorem 2.10, part 1). This result is closely related to similar results established by Barmak and Minian (Adv. in Math., 218 (2008), 87-104) in the framework of posets and we give the relation between the two approaches (theorems 3.5 and 3.7). We conclude with a question about the relation between the s-homotopy and the graph homotopy defined by Chen, Yau and Yeh (Discrete Math., 241(2001), 153-170).
Denham, Suciu and Panov, Ray computed ranks of homotopy groups and Poincaré series of a moment-angle-complex $\mathcal Z(\mathcal K$) / Davis-Januzskiewicz space $DJ(\mathcal K)$ associated to a flag simplicial complex $\mathcal K$. In this note we revisit these results and interpret them as polynomial bounds on the face numbers of an arbitrary simplicial flag complex.
If $K$ is a simplicial complex on $m$ vertices the flagification of $K$ is the minimal flag complex $K^f$ on the same vertex set that contains $K$. Letting $L$ be the set of vertices, there is a sequence of simplicial inclusions $L\to K\to K^f$. This induces a sequence of maps of polyhedral products $(\underline X,\underline A)^L\stackrel g\longrightarrow(\underline X,\underline A)^K\stackrel f\longrightarrow (\underline X,\underline A)^{K^f}$. We show that $Ωf$ and $Ωf\circΩg$ have right homotopy inverses and draw consequences. For a flag complex $K$ the polyhedral product of the form $(\unde…
For $n \in \mathbb{N}$, let $h(n)$ denote the number of simplicial complexes on $n$ vertices up to homotopy equivalence. Here we prove that $h(n) \geq 2^{2^{0.02n}}$ when $n$ is large enough. Together with the trivial upper bound of $2^{2^n}$ on the number of labeled simplicial complexes on $n$ vertices this proves a conjecture of Kalai that $h(n)$ is doubly exponential in $n$.
Given a finite CAT(0) cubical complex, we define a flag simplicial complex associated to it, called the crossing complex. We show that the crossing complex holds much of the combinatorial information of the original cubical complex: for example, hyperplanes in the cubical complex correspond to vertex links in the crossing complex, and the crossing complex is balanced if and only if the cubical complex is cubically balanced. The most significant result is that the sets of $f$-vectors of CAT(0) cubical complexes and flag simplicial complexes are equal, up to an invertible linear transformation.
We prove that the family of facets of a pure simplicial complex of dimension up to three satisfies the Erdős-Ko-Rado property whenever it is flag and has no boundary ridges. We conjecture the same to be true in arbitrary dimension and give evidence for this conjecture. Our motivation is that complexes with these two properties include flag pseudo-manifolds and cluster complexes.
We study the equivariant flag $f$-vector and equivariant flag $h$-vector of a balanced relative simplicial complex with respect to a group action. When the complex satisfies Serre's condition $(S_{\ell}),$ we show that the equivariant flag $h$-vector, the equivariant $h$-vector, and the equivariant $f$-vector satisfy several inequalities. We apply these results to the study of $P$-partitions of double posets, and weak colorings of mixed graphs.
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 groups.
In this note we construct a flag simplicial $3$-sphere $Δ$ with the following properties: - $Δ$ is not a suspension; - $Δ$ has no edge that can be contracted to obtain another flag sphere; - The only equators (induced subcomplexes which are spheres of codimension $1$) of $Δ$ are vertex links. Our construction has $12$ vertices, the minimum number of vertices such a simplicial complex can have. This answers a question posed by Chudnovsky and Nevo.
Directed graphs are ubiquitous models for networks, and topological spaces they generate, such as the directed flag complex, have become useful objects in applied topology. The simplices are formed from directed cliques. We extend Atkin's theory of $q$-connectivity to the case of directed simplices. This results in a preorder where simplices are related by sequences of simplices that share a $q$-face with respect to directions specified by chosen face maps. We leverage the Alexandroff equivalence between preorders and topological spaces to introduce a new class of topological spaces for direct…
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 …
Strong placement games (SP-games) are a class of combinatorial games whose structure allows one to describe the game via simplicial complexes. A natural question is whether well-known invariants of combinatorial games, such as "game value", appear as invariants of the simplicial complexes. This paper is the first step in that direction. We show that every simplicial complex encodes a certain type of SP-game (called an "invariant SP-game") whose ruleset is independent of the board it is played on. We also show that in the class of SP-games isomorphic simplicial complexes correspond to isomorphi…
We give a survey on the recent results and problems on the face enumeration of flag complexes and flag simplicial spheres, with an emphasis on the characterization of face vectors of flag complexes, several lower-bound type of conjectures including the Charney-Davis conjecture and Gal's conjecture, and the upper bound conjecture for flag spheres and pseudomanifolds.
We provide a random simplicial complex by applying standard constructions to a Poisson point process in Euclidean space. It is gigantic in the sense that - up to homotopy equivalence - it almost surely contains infinitely many copies of every compact topological manifold, both in isolation and in percolation.
We give a simple combinatorial model for plethysm. Precisely, the bialgebra dual to plethystic substitution is realised as the homotopy cardinality of the incidence bialgebra of an explicit simplicial groupoid, obtained from surjections by a construction reminiscent of the Waldhausen S and the Quillen Q-construction.
We implement an algorithm RSHT (Random Simple-Homotopy) to study the simple-homotopy types of simplicial complexes, with a particular focus on contractible spaces and on finding substructures in higher-dimensional complexes. The algorithm combines elementary simplicial collapses with pure elementary expansions. For triangulated d-manifolds with d < 7, we show that RSHT reduces to (random) bistellar flips. Among the many examples on which we test RSHT, we describe an explicit 15-vertex triangulation of the Abalone, and more generally, (14k+1)-vertex triangulations of Bing's houses with k rooms,…
It was proven by González-Meneses, Manchón and Silvero that the extreme Khovanov homology of a link diagram is isomorphic to the reduced (co)homology of the independence simplicial complex obtained from a bipartite circle graph constructed from the diagram. In this paper we conjecture that this simplicial complex is always homotopy equivalent to a wedge of spheres. In particular, its homotopy type, if not contractible, would be a link invariant and it would imply that the extreme Khovanov homology of any link diagram does not contain torsion. We prove the conjecture in many special cases and f…
