Related papers: Simplicial complexes with many facets are vertex d…

A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V(G)|$, the graph $G$ is called very well-covered. The class…

For the distance function from any closed subset of any complete Finsler manifold, we prove that the singular set is equal to a countable union of delta-convex hypersurfaces up to an exceptional set of codimension two. In addition, in…

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…

Let $\Delta$ be a $g_2$-minimal normal 3-pseudomanifold. A vertex in $\Delta$ whose link is not a sphere is called a singular vertex. When $\Delta$ contains at most two singular vertices, its combinatorial characterization is known [9]. In…

Let Delta_{n-1} denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Delta_{n-1} obtained by starting with the full (k-1)-dimensional skeleton of Delta_{n-1} and then adding each k-simplex independently with…

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

We study copositive matrices which admit a decomposition into a sum of a positive semidefinite matrix and a matrix with nonnegative entries. Our main result shows that if the off-diagonal entries of a copositive matrix are nondecreasing in…

We introduce "$t$-LC triangulated manifolds" as those triangulations obtainable from a tree of $d$-simplices by recursively identifying two boundary $(d-1)$-faces whose intersection has dimension at least $d-t-1$. The $t$-LC notion…

While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…

Let Y be a random d-dimensional subcomplex of the (n-1)-dimensional simplex S obtained by starting with the full (d-1)-dimensional skeleton of S and then adding each d-simplex independently with probability p=c/n. We compute an explicit…

We study $h$-vectors of simplicial complexes which satisfy Serre's condition ($S_r$). We say that a simplicial complex $\Delta$ satisfies Serre's condition ($S_r$) if $\tilde H_i(\lk_\Delta(F);K)=0$ for all faces $F \in \Delta$ and for all…

Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee…

We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…

We analyze the topology and geometry of a polyhedron of dimension 2 according to the minimum size of a cover by PL collapsible polyhedra. We provide partial characterizations of the polyhedra of dimension 2 that can be decomposed as the…

We generalize a result of Serre's to show that if every vertex of some fixed type of a convex subcomplex of an irreducible spherical building has an opposite, then the subcomplex is completely reducible.

Suppose that $C$ is a centrally symmetric $d$-dimensional convex polytope; in 1989 Kalai conjectured that $C$ has at least $3^d$ facets. We prove this result if there are $d$ hyperplanes with orthogonal normal vectors so that $C$ is…

It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…

In this paper we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph $G$ on $n$…

Let $I(\Delta)^{[k]}$ denote the $k^{\text{th}}$ square-free power of the facet ideal of a simplicial complex $\Delta$ in a polynomial ring $R$. Square-free powers are intimately related to the `Matching Theory' and `Ordinary Powers'. In…

In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even…