Related papers: $k$-shellable simplicial complexes and graphs
We show that the K-theory spectra of many assemblers, such as the assembler of polytopes in euclidean, hyperbolic or spherical geometry, as well as the assembler of definable sets, are equivalent to the K-theory spectrum of a squares…
For every simplicial complex K there exists a vertex-transitive simplicial complex homotopy equivalent to a wedge of copies of K with some copies of the circle. It follows that every simplicial complex can occur as a homotopy wedge summand…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…
Given a chiral d-polytope K with regular facets, we describe a construction for a chiral (d + 1)-polytope P with facets isomorphic to K. Furthermore, P is finite whenever K is finite. We provide explicit examples of chiral 4-polytopes…
A compactness theorem is proved for a family of K\"{a}hler surfaces with constant scalar curvature and volume bounded from below, diameter bounded from above, Ricci curvature bounded and the signature bounded from below. Furthermore, a…
We introduce a notion of Morse shellings (and tilings) on finite simplicial complexes which extends the classical one and its relation to discrete Morse theory.Skeletons and barycentric subdivisions of Morse shellable (or tileable)…
Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…
First we confirm a conjecture asserting that any compact K\"ahler manifold $N$ with $\Ric^\perp>0$ must be simply-connected by applying a new viscosity consideration to Whitney's comass of $(p, 0)$-forms. Secondly we prove the projectivity…
Let $K$ be a field and $I$ a monomial ideal of the polynomial ring $S=K[x_1,\ldots, x_n]$. We show that if either: 1) $I$ is almost complete intersection, 2) $I$ can be generated by less than four monomials; or 3) $I$ is the Stanley-Reisner…
This paper is concerned with the surface embedding of matching extendable graphs. There are two directions extending the theory of perfect matchings, that is, matching extendability and factor-criticality. In solving a problem posed by…
In this paper we prove that if S is a smooth, irreducible, projective, rational, complex surface and D an effective, connected, reduced divisor on S, then the pair (S,D) is contractible if the log-Kodaira dimension of the pair is $-\infty$.…
We define and study a homological version of Sullivan's rational de Rham complex for simplicial sets. This new functor can be generalised to simplicial symmetric spectra and in that context it has excellent categorical properties which…
We show that coloring properties of a simplicial complex K are reflected by splitting properties of a bundle over the associated Davis-Januszkiewicz space whose Chern classes are given by the elementary symmetric polynomials in the…
We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…
Consider a simplicial complex that allows for an embedding into $\mathbb{R}^d$. How many faces of dimension $\frac{d}{2}$ or higher can it have? How dense can they be? This basic question goes back to Descartes' "Lost Theorem" and Euler's…
This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation…
The Golodness of a simplicial complex is defined algebraically in terms of the Stanley-Reisner ring, and it has been a long-standing problem to find its combinatorial characterization. The tightness of a simplicial complex is a…
A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof…