Related papers: Strong shellability of simplicial complexes
We recently defined a property of Morse shellability (and tileability) of finite simplicial complexes which extends the classical one and its relations with discrete Morse theory. We now prove that the product of two Morse tileable or…
After [J.Herzog, D.Popescu, Finite filtrations of modules and shellable multicomplexes, Preprint IMAR no 4/2005, Bucharest, 2005], the shellability of multicomplexes $\Gamma$ is given in terms of some special faces of $\Gamma$ called…
A simplicial complex $\Delta$ is a virtually Cohen-Macaulay simplicial complex if its associated Stanley-Reisner ring $S$ has a virtual resolution, as defined by Berkesch, Erman, and Smith, of length ${\rm codim}(S)$. We provide a…
An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…
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 prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…
It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen-Macaulay order complex in exactly the same conditions. The…
We consider spline functions over simplicial meshes in $\RR^n$. We assume that the spline pieces join together with some finite order of smoothness but the pieces themselves are infinitely smooth. Such splines can have extra orders of…
In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…
The principles behind the sharp, singular structures in a crumpled sheet are well understood. Here we discuss more general ways of exploiting such sharp structures to control the shape of a sheet by deforming or forcing it elsewhere. Often,…
In this article we investigate the shellability of the flag simplicial complexes attached to non-simple and thin polyominoes. As a consequence, we obtain the Cohen-Macaulayness and a combinatorial interepetation of the $h$-polynomial of the…
In this paper we give a necessary combinatorial condition for a negative--definite plumbing tree to be suitable for rational blow--down, or to be the graph of a complex surface singularity which admits a rational homology disk smoothing.…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
Let $\D$ be a $(d-1)$-dimensional pure $f$-simplicial complex over vertex set $[n]$. In this paper, it is proved that $n=2d$ holds true if $\D$ is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies…
In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…
We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…
We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.
We introduce a fast and memory efficient approach to compute the persistent homology (PH) of a sequence of simplicial complexes. The basic idea is to simplify the complexes of the input sequence by using strong collapses, as introduced by…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
We introduce a model of attractive penetrable spheres by adding a short range attractive square well outside a penetrable core, and we provide a detailed analysis of structural and thermodynamical properties in one dimension using the exact…