English
Related papers

Related papers: Strong shellability of simplicial complexes

200 papers

When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…

Commutative Algebra · Mathematics 2014-04-09 Yi-Huang Shen

For a reduced pure dimensional complex space $X$, we show that if Barlet's recently introduced sheaf $\alpha_X^1$ of holomorphic $1$-forms or the sheaf of germs of weakly holomorphic $1$-forms is locally free, then $X$ is smooth. Moreover,…

Complex Variables · Mathematics 2020-05-18 Håkan Samuelsson Kalm , Martin Sera

In this paper we show that a $k$-shellable simplicial complex is the expansion of a shellable complex. We prove that the face ring of a pure $k$-shellable simplicial complex satisfies the Stanley conjecture. In this way, by applying…

Commutative Algebra · Mathematics 2017-01-12 Rahim Rahmati-Asghar

Given a shifted order ideal $U$, we associate to it a family of simplicial complexes $(\Delta_t(U))_{t\geq 0}$ that we call squeezed complexes. In a special case, our construction gives squeezed balls that were defined and used by Kalai to…

Combinatorics · Mathematics 2018-08-03 Martina Juhnke-Kubitzke , Uwe Nagel

We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the $CL$-shellability criterion of Bj\"orner and Wachs for posets and its generalization by Kozlov called $CC$-shellability. We…

Combinatorics · Mathematics 2007-05-23 Patricia Hersh

The \emph{strong collapse} of a simplicial complex, proposed by Barmak and Minian (\emph{Disc. Comp. Geom. 2012}), is a combinatorial collapse of a complex onto its sub-complex. Recently, it has received attention from computational…

Computational Geometry · Computer Science 2023-01-10 Jean-Daniel Boissonnat , Kunal Dutta , Soumik Dutta , Siddharth Pritam

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

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

Computational Geometry · Computer Science 2013-06-17 Prosenjit Bose , Vida Dujmovic , Pat Morin , Michiel Smid

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

In the present paper, motivated by a conjecture of Jahan and Zheng, we prove that componentwise polymatroidal ideals have linear quotients. This solves positively a conjecture of Bandari and Herzog.

Commutative Algebra · Mathematics 2023-12-29 Antonino Ficarra

We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…

Commutative Algebra · Mathematics 2010-04-21 Hassan Haghighi , Naoki Terai , Siamak Yassemi , Rahim Zaare-Nahandi

The focus of this article is the study of a certain type of singularities and their transfer properties in a universally equidimensional morphism (i.e. an open morphism with constant pure-dimensional fibers). The singularities of interest…

Algebraic Geometry · Mathematics 2025-07-08 Mohamed Kaddar

A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…

Combinatorics · Mathematics 2021-02-11 Yibo Gao , Junyao Peng

The design of complex materials and the formation of specific patterns often arise from the properties of the individual building blocks. In this respect, colloidal systems offer a unique opportunity because nowadays they can be synthesized…

Soft Condensed Matter · Physics 2022-03-01 Fabrizio Camerin , Emanuela Zaccarelli

In this article, we show that if $X$ is an excellent surface with rational singularities, the constant sheaf $\mathbb{Q}_{\ell}$ is a dualizing complex. In coefficient $\mathbb{Z}_{\ell}$, we also prove that the obstruction for…

Algebraic Geometry · Mathematics 2010-05-03 Ting Li

The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem…

Optimization and Control · Mathematics 2020-04-24 Olga Kostyukova , Tatiana Tchemisova

It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…

Commutative Algebra · Mathematics 2022-04-01 Hailong Dao , David Eisenbud

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…

Combinatorics · Mathematics 2021-08-24 Russ Woodroofe

This paper grew as a continuation of [Sh462] but in the present form it can serve as a motivation for it as well. We deal with the same notions, and use just one simple lemma from there. Originally entangledness was introduced in order to…

Logic · Mathematics 2016-09-07 Ofer Shafir , Saharon Shelah