English
Related papers

Related papers: Shellings and sheddings induced by collapses

200 papers

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…

Commutative Algebra · Mathematics 2026-04-06 Mohammed Rafiq Namiq

A conjecture of Kalai from 1994 posits that for an arbitrary $2\leq k\leq \lfloor d/2 \rfloor$, the combinatorial type of a simplicial $d$-polytope $P$ is uniquely determined by the $(k-1)$-skeleton of $P$ (given as an abstract simplicial…

Combinatorics · Mathematics 2022-04-28 Isabella Novik , Hailun Zheng

We disprove a long-standing open conjecture due to Simon stating that all skeleta of simplices are extendably shellable. In particular, for every $d \geq 3$ we provide a pure $d$-dimensional shellable simplicial complex which is not…

Combinatorics · Mathematics 2026-05-26 Davide Bolognini , Paolo Sentinelli

For a graph $G$ on $[n]$, the $k$-cut complex $\Delta_k(G)$ has facets $[n]\setminus T$, where $T$ ranges over the disconnected $k$-vertex induced subgraphs of $G$. Bayer, Denker, Jeli\'c Milutinovi\'c, Sundaram, and Xue proved that the…

Combinatorics · Mathematics 2026-05-28 Yutong Zhang , Yaoran Yang

We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…

Combinatorics · Mathematics 2026-02-11 Rakesh Ghosh , S Selvaraja

We consider a simplicial complex generaliztion of a result of Billera and Meyers that every nonshellable poset contains the smallest nonshellable poset as an induced subposet. We prove that every nonshellable $2$-dimensional simplicial…

Combinatorics · Mathematics 2008-02-03 Michelle L. Wachs

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…

Combinatorics · Mathematics 2007-11-06 Adam Van Tuyl , Rafael H. Villarreal

Let $K$ be a simplicial complex on vertex set $V$. $K$ is called $d$-Leray if the homology groups of any induced subcomplex of $K$ are trivial in dimensions $d$ and higher. $K$ is called $d$-collapsible if it can be reduced to the void…

Combinatorics · Mathematics 2021-09-08 Minki Kim , Alan Lew

Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…

Combinatorics · Mathematics 2011-07-07 Martin Tancer

We give a new proof of an old identity of Dixon (1865-1936) that uses tools from topological combinatorics. Dixon's identity is re-established by constructing an infinite family of non-pure simplicial complexes $\Delta(n)$, indexed by the…

Combinatorics · Mathematics 2016-05-12 Ruth Davidson , Augustine O'Keefe , Daniel Parry

We introduce the class of linearly shellable pure simplicial complexes. The characterizing property is the existence of a labeling of their vertices such that all linear extensions of the Bruhat order on the set of facets are shelling…

Combinatorics · Mathematics 2024-10-29 Paolo Sentinelli

In a previous paper [9], we proved the following singularity theorem applicable to cosmological models with a positive cosmological constant: if a four-dimensional spacetime satisfying the null energy condition contains a compact Cauchy…

General Relativity and Quantum Cosmology · Physics 2025-12-12 Gregory J. Galloway , Eric Ling

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

Commutative Algebra · Mathematics 2009-02-26 Mohammad Mahmoudi , Amir Mousivand , Siamak Yassemi

Let $\mathscr{X}$ be the boundary complex of a $(d+1)$-polytope, and let $\rho(d+1,k) = \frac{1}{2}[{\lceil (d+1)/2 \rceil \choose d-k} + {\lfloor (d+1)/2 \rfloor \choose d-k}]$. Recently, the author, answering B\'ar\'any's question from…

Combinatorics · Mathematics 2024-09-16 Joshua Hinman

In this paper, we give a new algebraic criterion for the {\em shellability} of (non-pure) simplicial complex $\Delta$ over $[n]$, shellable in the sense of Bj\"orner and Wachs \cite{BW}. We show that the spanning simplicial complex of…

Commutative Algebra · Mathematics 2017-04-20 Imran Anwar , Zunaira Kosar , Shaheen Nazir , Khurram Shabbir

We show that a plt surface singularity $(P\in X,B)$ is $F$-liftable if and only if it is $F$-pure and is not a rational double point of type $E_8^1$ in characteristic $p=5$. As a consequence, we prove the logarithmic extension theorem for…

Algebraic Geometry · Mathematics 2024-02-14 Tatsuro Kawakami , Teppei Takamatsu

We prove that for a simplicial complex $K$ whose Taylor resolution for the Stanley-Reisner ring is minimal, the following four conditions are equivalent: (1) $K$ satisfies the strong gcd-condition; (2) $K$ is Golod; (3) the moment-angle…

Algebraic Topology · Mathematics 2017-03-20 Kouyemon Iriye , Daisuke Kishimoto

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…

Algebraic Geometry · Mathematics 2020-10-26 Jean-Yves Welschinger

We prove a strengthening of the trickle down theorem for partite complexes. Given a $(d+1)$-partite $d$-dimensional simplicial complex, we show that if "on average" the links of faces of co-dimension 2 are $\frac{1-\delta}{d}$-(one-sided)…

Discrete Mathematics · Computer Science 2023-06-21 Dorna Abdolazimi , Shayan Oveis Gharan

In 1980 Provan and Billera defined the notion of weak $k$-decomposability for pure simplicial complexes. They showed the diameter of a weakly $k$-decomposable simplicial complex $\Delta$ is bounded above by a polynomial function of the…

Combinatorics · Mathematics 2012-03-09 Jesus A. De Loera , Steven Klee