Related papers: $k$-shellable simplicial complexes and graphs
The theory of shellable simplicial complexes brings together combinatorics, algebra, and topology in a remarkable way. Initially introduced by Alder for $q$-simplicial complexes, recent work of Ghorpade, Pratihar, and Randrianarisoa extends…
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree…
Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…
In this paper, we study MRC fibrations of compact K\"ahler manifolds with partially semi-positive curvature. We first prove that a compact K\"ahler manifold is rationally connected if its tangent bundle is BC-$p$ positive for all $1\leq…
We work over an o-minimal expansion of a real closed field R. Given a closed simplicial complex K and a finite number of definable subsets of its realization |K| in R we prove that there exists a triangulation (K',f) of |K| compatible with…
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…
We examine virtual resolutions of Stanley-Reisner ideals for a product of projective spaces. In particular, we provide sufficient conditions for a simplicial complex to be virtually Cohen-Macaulay (to have a virtual resolution with length…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
Invoking the density argument of Dundas-Goodwillie-McCarthy, we extend the Fundamental Theorem of $K$-theory from the category of simplicial rings to the category of $\mathbb{S}$-algebras. As an intermediate step, we prove the Fundamental…
In this paper, Brou\'e's conjecture is reduced to simple groups, with an additional stability condition.
The (n,k)-hypersimplex is the convex hull of all 0/1-vectors of length n with coordinate sum k. We explicitly determine the extension complexity of all hypersimplices as well as of certain classes of combinatorial hypersimplices. To that…
We introduce two simplicial complexes, the noncrossing matching complex and the noncrossing bipartite complex. Both complexes are intimately related to the bubble lattice introduced in our earlier article "Bubble Lattices I: Structure"…
In this paper, we provide the first known infinite family of simple graphs, each of which is the skeleton of a chiral map, a skeleton of a reflexible map on an orientable surfaces, as well as a skeleton of a reflexible map on a…
A quantum solvable algebra is an iterated $q$-skew extension of a commutative algebra. We get finite statification of prime spectrum for quantum solvable algebras obeying some natural conditions. We prove that for any prime ideal $I$ the…
In the 70:th, combinatorialists begun to systematically relate simplicial complexes and polynomial algebras, named Stanley-Reisner rings or face rings. This demanded an algebraization of the simplicial complexes, that turned the empty…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.…
In this paper, we introduce the concept of $k$-clean monomial ideals as an extension of clean monomial ideals and present some homological and combinatorial properties of them. Using the hierarchal structure of $k$-clean ideals, we show…
The antiprism triangulation provides a natural way to subdivide a simplicial complex $\Delta$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as…