English
Related papers

Related papers: $k$-shellable simplicial complexes and graphs

200 papers

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

Combinatorics · Mathematics 2008-04-12 Sangwook Kim

Refining a basic result of Alexander, we show that two flag simplicial complexes are piecewise linearly homeomorphic if and only if they can be connected by a sequence of flag complexes, each obtained from the previous one by either an edge…

Combinatorics · Mathematics 2014-08-08 Frank H. Lutz , Eran Nevo

Let $\mathcal{P}$ be a frame polyomino, a new kind of non-simple polyomino. In this paper we study the $h$-polynomial of $K[\mathcal{P}]$ in terms of the switching rook polynomial of $\mathcal{P}$ using the shellable simplicial complex…

Combinatorics · Mathematics 2023-12-05 Rizwan Jahangir , Francesco Navarra

Let $I$ be a monomial squarefree ideal of a polynomial ring $S$ over a field $K$ such that the sum of every three different of its minimal prime ideals is the maximal ideal of $S$, or more general a constant ideal. We associate to $I$ a…

Commutative Algebra · Mathematics 2011-05-06 Dorin Popescu

We show that the Golod property of a Stanley-Reisner ring can depend on the characteristic of the base field. More precisely, for every finite set $T$ of prime numbers we construct simplicial complexes $\Delta$ and $\Gamma$, such that…

Commutative Algebra · Mathematics 2016-06-07 Lukas Katthän

We prove that for every $d\geq 2$, deciding if a pure, $d$-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for…

Combinatorics · Mathematics 2018-01-26 Xavier Goaoc , Pavel Paták , Zuzana Patáková , Martin Tancer , Uli Wagner

A simplicial complement P is a sequence of subsets of [m] and the simplicial complement P corresponds to a unique simplicial complex K with vertices in [m]. In this paper, we defined the homology of a simplicial complement…

Algebraic Topology · Mathematics 2010-11-22 Xiangjun Wang , Qibing Zheng

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and…

Combinatorics · Mathematics 2007-10-14 Raul Cordovil , Manoel Lemos , Claudia Linhares Sales

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 provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

Combinatorics · Mathematics 2021-01-26 Karim Adiprasito , Geva Yashfe

We study Stanley decompositions and show that Stanley's conjecture on Stanley decompositions implies his conjecture on partitionable Cohen-Macaulay simplicial complexes. We also prove these conjectures for all Cohen-Macaulay monomial ideals…

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Ali Soleyman Jahan , Siamak Yassemi

We show that for proving the Stanley conjecture, it is sufficient to consider a very special class of monomial ideals. These ideals (or rather their lcm lattices) are in bijection with the simplicial spanning trees of skeletons of a…

Commutative Algebra · Mathematics 2015-03-10 Lukas Katthän

The independence complex of a chordal graph is known to be shellable due to a result of Van Tuyl and Villarreal. This is equivalent to the fact that cover ideal of a chordal graph has linear quotients. We use this result to obtain recursive…

Commutative Algebra · Mathematics 2020-03-03 Nursel Erey

The $k$-cut complex was recently introduced by Bayer et al. as a generalization of earlier work of Fr{\"o}berg (1990) and Eagon and Reiner (1998), and was shown to be shellable for several classes of graphs. In this article, we prove that…

Combinatorics · Mathematics 2026-02-06 Himanshu Chandrakar

For a simplicial complex $\Delta$, the affect of the expansion functor on combinatorial properties of $\Delta$ and algebraic properties of its Stanley-Reisner ring has been studied in some previous papers. In this paper, we consider the…

Commutative Algebra · Mathematics 2017-01-18 Somayeh Moradi , Rahim Rahmati-Asghar

When a cone is added to a simplicial complex $\Delta$ over one of its faces, we investigate the relation between the arithmetical ranks of the Stanley-Reisner ideals of the original simplicial complex and the new simplicial complex…

Commutative Algebra · Mathematics 2011-02-19 Margherita Barile , Naoki Terai

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

Combinatorics · Mathematics 2023-11-10 Florian Frick , Mirabel Hu , Verity Scheel , Steven Simon

The multiplicity conjecture of Herzog, Huneke, and Srinivasan is verified for the face rings of the following classes of simplicial complexes: matroid complexes, complexes of dimension one and two, and Gorenstein complexes of dimension at…

Commutative Algebra · Mathematics 2007-05-23 Isabella Novik , Ed Swartz

Motivated by the splitting principle, we define certain simplicial complexes associated to an associative ring $A$, which have an action of the general linear group $GL(A)$. This leads to an exact sequence, involving Quillen's algebraic…

Algebraic Geometry · Mathematics 2015-03-17 M. V. Nori , V. Srinivas

A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani in 1987, via a non-constructive proof…

Combinatorics · Mathematics 2022-07-01 Cesar Ceballos , Joseph Doolittle