Related papers: Shellable complexes and topology of diagonal arran…
We recently introduced a notion of tilings of geometric realizations of finite relative simplicial complexes and related those tilings to the discrete Morse theory of R. Forman, especially when they have the property of being shellable, a…
We show that the discretized configuration space of $k$ points in the $n$-simplex is homotopy equivalent to a wedge of spheres of dimension $n-k+1$. This space is homeomorphic to the order complex of the poset of ordered partial partitions…
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider…
We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…
We extend the definition of chordal from graphs to clutters. The resulting family generalizes both chordal graphs and matroids, and obeys many of the same algebraic and geometric properties. Specifically, the independence complex of a…
We show that every sheaf on the site of smooth manifolds with values in a stable (infinity,1)-category (like spectra or chain complexes) gives rise to a differential cohomology diagram and a homotopy formula, which are common features of…
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong…
We show that the disk complex of a genus $g>1$ Heegaard surface for the 3-sphere is homotopy equivalent to a wedge of $(2g-2)$-dimensional spheres. This implies that genus $g>1$ Heegaard surfaces for the 3-sphere are topologically minimal…
Intersection homology is defined for simplicial, singular and PL chains and it is well known that the three versions are isomorphic for a full filtered simplicial complex. In the literature, the isomorphism, between the singular and the…
Let A be a subspace arrangement with a geometric lattice such that codim(x) > 1 for every x in A. Using rational homotopy theory, we prove that the complement M(A) is rationally elliptic if and only if the sum of the orthogonal subspaces is…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
We use the topology of simplicial complexes to model political structures following [1]. Simplicial complexes are a natural tool to encode interactions in the structures since a simplex can be used to represent a subset of compatible…
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
We define a link lattice complex for plumbed links, generalizing constructions of Ozsv\'ath, Stipsicz and Szab\'o, and of Gorsky and N\'emethi. We prove that for all plumbed links in rational homology 3-spheres, the link lattice complex is…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
A locally flatly embedded $2$-sphere in a compact $4$-manifold $X$ is called a spine if the inclusion map is a homotopy equivalence. A spine is called simple if the complement of the $2$-sphere has abelian fundamental group. We prove that…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…