Search

The well known fractional Helly theorem and colorful Helly theorem can be merged into the so called colorful fractional Helly theorem. It states: For every $\alpha \in (0, 1]$ and every non-negative integer $d$, there is $\beta_{col} = \beta_{col}(\alpha, d) \in (0, 1]$ with the following property. Let $\mathcal{F}_1, \dots, \mathcal{F}_{d+1}$ be finite nonempty families of convex sets in $\mathbb{R}^d$ of sizes $n_1, \dots, n_{d+1}$ respectively. If at least $\alpha n_1 n_2 \cdots n_{d+1}$ of the colorful $(d+1)$-tuples have a nonempty intersection, then there is $i \in [d+1]$ such that $\mathcal{F}_i$ contains a subfamily of size at least $\beta_{col} n_i$ with a nonempty intersection. (A colorful $(d+1)$-tuple is a $(d+1)$-tuple $(F_1, \dots , F_{d+1})$ such that $F_i$ belongs to $\mathcal{F}_i$ for every $i$.) The colorful fractional Helly theorem was first stated and proved by B\'ar\'any, Fodor, Montejano, Oliveros, and P\'or in 2014 with $\beta_{col} = \alpha/(d+1)$. In 2017 Kim proved the theorem with better function $\beta_{col}$, which in particular tends to $1$ when $\alpha$ tends to $1$. Kim also conjectured what is the optimal bound for $\beta_{col}(\alpha, d)$ and provided the upper bound example for the optimal bound. The conjectured bound coincides with the optimal bounds for the (non-colorful) fractional Helly theorem proved independently by Eckhoff and Kalai around 1984. We verify Kim's conjecture by extending Kalai's approach to the colorful scenario. Moreover, we obtain optimal bounds also in more general setting when we allow several sets of the same color., Comment: 13 pages, 1 figure. The main technical result is extended to c colors, where c is a positive integer, in contrast to the previous version where we only allowed (d+1) colors. We added the acknowledgments

We show that the sequentially $(S_r)$ condition for simplicial complexes is a topological property. Along the way, we present an elementary proof for the fact that the Serre's condition $(S_r)$ is a topological property.

Inspired by the works of Adiprasito, Babson, Nevo, and Murai on the $g$-conjecture, we consider different classes of PL-spheres and the relations between them. We focus on a certain class of spheres that is in the intersection of vertex-decomposable spheres (a concept due to Provan and Billera) and strongly edge-decomposable spheres (a concept due to Eran Nevo). The spheres in this class are exactly those vertex-decomposable ones for which Adiprasito's recent proof method works.

We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic approach to deriving upper bounds for the number of top-dimensional faces of such complexes, particularly in low dimensions.

Let $\k$ be a field and let $A$ be a standard $\mathbb{N}$-graded $\k$-algebra. Using numerical information of some invariants in the primary decomposition of $0$ in $A$, namely the so called dimension filtration, we associate a bivariate polynomial $\BW(A;t,w)$, that we call the Bj\"{o}rner--Wachs polynomial, to $A$. It is shown that the Bj\"{o}rner--Wachs polynomial is an algebraic counterpart of the combinatorially defined $h$-triangle of finite simplicial complexes introduced by Bj\"{o}rner \& Wachs. We provide a characterisation of sequentially Cohen--Macaulay algebras in terms of the effect of the reverse lexicographic generic initial ideal on the Bj\"{o}rner--Wachs polynomial. More precisely, we show that a graded algebra is sequentially Cohen--Macaulay if and only if it has a stable Bj\"{o}rner--Wachs polynomial under passing to the reverse lexicographic generic initial ideal. We conclude by discussing connections with the Hilbert series of local cohomology modules.

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the classical Macaulay-Stanley theorem to the nonpure case. Moreover, we characterize the possible Betti tables of componentwise linear ideals. A key tool in our investigation is a bijection between shifted multicomplexes of degree at most d and shifted pure (d-1)-dimensional simplicial complexes., Comment: 11 pages, 1 figure

The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this note, we provide a unifying approach which allows us to obtain more general results. Moreover, we provide a relation to commutative algebra by relating connectivity problems to graded Betti numbers of the associated Stanley--Reisner rings., Comment: 4 pages, minor changes

The clique vector $\mathfrak{c}(G)$ of a graph $G$ is the sequence $(c_1, c_2, \ldots,c_d)$ in $\mathbb{N}^d$, where $c_i$ is the number of cliques in $G$ with $i$ vertices and $d$ is the largest cardinality of a clique in $G$. In this note, we use tools from commutative algebra to characterize all possible clique vectors of $k$-connected chordal graphs.

Herzog and Takayama constructed explicit resolutions for the class of so called ideals with a regular linear quotient. This class contains all matroidal and stable ideals. The resolutions of matroidal and stable ideals are known to be cellular. In this note we show that the Herzog--Takayama resolution is also cellular.

In this paper we verify a conjecture by Kozlov (Discrete Comput Geom 18 (1997) 421--431), which describes the convex hull of the set of face vectors of $r$-colorable complexes on $n$ vertices. As part of the proof we derive a generalization of Tur\'{a}n's graph theorem.

In this note we show that every discrete polymatroid is $M$-shellable. This gives, in a partial case, a positive answer to a conjecture of Chari and improves a recent result of Schweig where he proved that the $h$-vector of a lattice path matroid satisfies a conjecture of Stanley., Comment: 4 pages