Related papers: The worst way to collapse a simplex
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…
Let L be a compact convex set in R^n, and let 1 <= d <= n-1. The set L is defined to be d-decomposable if L is a direct Minkowski sum (affine Cartesian product) of two or more convex bodies each of dimension at most d. A compact convex set…
Collapsibility is a combinatorial strengthening of contractibility. We relate this property to metric geometry by proving the collapsibility of any complex that is CAT(0) with a metric for which all vertex stars are convex. This strengthens…
There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call…
A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a…
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…
We introduce and study strongly vertex dismissible, vertex dismissible, and scalable simplicial complexes as non-pure extensions of vertex decomposability and shellability. Strong vertex dismissibility is defined recursively by relaxing the…
We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.
We introduce and investigate $d$-convex union representable complexes: the complexes that arise as the nerve of a finite collection of convex open sets in $\mathbb R^d$ whose union is also convex. Chen, Frick, and Shiu recently proved that…
Studying crepant blow-ups of (compound) du Val singularities, we classify complexes of coherent sheaves which admit no negative self-extensions -- such a complex, up to flops and mutation equivalences, must either be (1) a module over a…
This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…
The shellability of the boundary complex of an unbounded polyhedron is investigated. To this end, it is necessary to pass to a suitable compactification, e.g., by one point. This observation can be exploited to prove that any tropical…
Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…
This paper deals with the existence, or absence, of coalescent contractions of contractible spaces. These are the contractions such that when the tracks of any two points meet, at time t0, they remain together thereafter. If a finite…
Four-manifold theory is employed to study the existence of (twisted) generalized complex structures. It is shown that there exist (twisted) generalized complex structures that have more than one type change loci. In an example-driven…
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…
A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…
We show that the independence complex of a tree is contractible if and only if it can be reduced to a path \( P_n \) with \( n \equiv 1 \pmod{3} \) by a sequence of truncation moves at branching points. As a consequence of our method, we…
While static equilibria of flexible strings subject to various load types (gravity, hydrostatic pressure, Newtonian wind) is well understood textbook material, the combinations of the very same loads can give rise to complex spatial…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…