Related papers: Leray numbers of tolerance complexes

Let K and L be compact convex sets in R^n. The following two statements are shown to be equivalent: (i) For every polytope Q inside K having at most n+1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 <= d <=…

Let p be a prime and let A be a subset of F_p. For k<p let X_{A,k} be the (k-1)-dimensional complex on the vertex set F_p with a full (k-2)-skeleton whose (k-1)-faces are k-subsets S of F_p such that the sum of the elements of S belongs to…

We give examples and counterexamples concerning varieties in which every tolerance is representable as $R \circ R^-$, for some reflexive and admissible relation $R$.

A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…

Let $\mathcal{C}(n,k)$ be the set of $k$-dimensional simplicial complexes $C$ over a fixed set of $n$ vertices such that: (1) $C$ has a complete $k-1$-skeleton; (2) $C$ has precisely ${{n-1}\choose {k}}$ $k$-faces; (3) the homology group…

A (d,k) set is a subset of R^d containing a translate of every k-dimensional plane. Bourgain showed that for k \geq k_{cr}(d), where k_{cr}(d) solves 2^{k_{cr}-1}+k_{cr} = d, every (d,k) set has positive Lebesgue measure. We give a short…

We define an (r,s)-coloring of an abstract simplicial complex to be a coloring using r colors of the vertices so that in any simplex at most s vertices have the same color. We translate the problem of finding an (r,s)-coloring of a given…

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer {\rm(}which may not be divisible by $k${\rm)} and let $s\le \lfloor n/k\rfloor-1$. We show that if $H$ is a $k$-uniform hypergraph…

In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such…

Let $G$ be a finite group of order $n$ and for $1 \leq i \leq k+1$ let $V_i=\{i\} \times G$. Viewing each $V_i$ as a $0$-dimensional complex, let $Y_{G,k}$ denote the simplicial join $V_1*\cdots*V_{k+1}$. For $A \subset G$ let $Y_{A,k}$ be…

We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree…

The Helly number of a family of sets with empty intersection is the size of its largest inclusion-wise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected…

We introduce and study a new combinatorial invariant the theta-number $\theta(X)$ of simplicial complexes, and prove that the inequality $\mathcal{C}(X)\leq \theta(X)$ holds for every simplicial complex $X$, where $\mathcal{C}(X)$ denotes…

Let $G$ be a connected, linear, real reductive Lie group with compact centre. Let $K<G$ be compact. Under a condition on $K$, which holds in particular if $K$ is maximal compact, we give a geometric expression for the multiplicities of the…

We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for…

The (weak) chromatic number of a hypergraph $H$, denoted by $\chi(H)$, is the smallest number of colors required to color the vertices of $H$ so that no hyperedge of $H$ is monochromatic. For every $2\le k\le d+1$, denote by $\chi_L(k,d)$…

We call a monoidal category ${\mathcal C}$ a Serre category if for any $C$, $D \in {\mathcal C}$ such that $C\ot D$ is semisimple, $C$ and $D$ are semisimple objects in ${\mathcal C}$. Let $H$ be an involutory Hopf algebra, $M$, $N$ two…

A $k$-partition of an $n$-set $X$ is a collection of $k$ pairwise disjoint non-empty subsets whose union is $X$. A family of $k$-partitions of $X$ is called $t$-intersecting if any two of its members share at least $t$ blocks. A…

Suppose $k$ is a positive integer and $\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function…

The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…