Related papers: If you can hide behind it, can you hide inside it?

In 1975 Wegner conjectured that the nerve of every finite good cover in R^d is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R^d such that the intersection of every subcollection is either empty or…

For $n\leq d$, a family ${\cal F}=\{C_0,C_1,\ldots, C_n\}$ of compact convex sets in $R^d$ is called an $n$-critical family provided any $n$ members of ${\cal F}$ have a non-empty intersection, but $\bigcap_{i=0}^n C_i=\varnothing$. If…

A well-known conjecture of Simon (1994) states that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the $(n-1)$-dimensional simplex, by attaching one facet at a time…

A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a…

We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…

In general a contractible complex need not be collapsible. Moreover, there exist complexes which are collapsible but even so admit a collapsing sequence where one "gets stuck", that is one can choose the collapses in such a way that one…

Suppose $G$ is finitely generated group and $\mathcal{C}(G)$ consists of all $\rho:G\to\operatorname{PGL}(n+1,\mathbb{R})$ for which there exists a properly convex set in $\mathbb{R}\mathbb{P}^n$ that is preserved by $\rho(G)$. Then the…

In this paper we prove new embedding results for compactly supported deformations of $CR$ submanifolds of $\mathbb{C}^{n+d}$: We show that if $M$ is a $2$-pseudoconcave $CR$ submanifold of type $(n,d)$ in $\mathbb{C}^{n+d}$, then any…

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…

Let X be a normed space. A subset A of X is approximately convex if $d(ta+(1-t)b,A) \le 1$ for all $a,b \in A$ and $t \in [0,1]$ where $d(x,A)$ is the distance of $x$ to $A$. Let $\Co(A)$ be the convex hull and $\diam(A)$ the diameter of…

Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…

This paper continues the study of a class of compact convex hypersurfaces in Euclidean space $R^{n+1}, ~n \geq 1$, which are boundaries of compact convex bodies obtained by taking the intersection of (solid) confocal paraboloids of…

Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…

A nonempty closed convex set in ${\mathbb R}^n$, not containing the origin, is called a pseudo-cone if with every $x$ it also contains $\lambda x$ for $x\ge 1$. We consider pseudo-cones with a given recession cone $C$, called…

An open convex set in real projective space is called divisible if there exists a discrete group of projective automorphisms which acts co-compactly. There are many examples of such sets and a theorem of Benoist implies that many of these…

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were…

Fix any $\lambda\in\mathbb{C}$. We say that a set $S\subseteq\mathbb{C}$ is $\lambda$-$convex$ if, whenever $a$ and $b$ are in $S$, the point $(1-\lambda)a+\lambda b$ is also in $S$. If $S$ is also (topologically) closed, then we say that…

The deck, $\mathcal{D}(X)$, of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}]\colon x \in X\}$, where $[Y]$ denotes the homeomorphism class of $Y$. A space $X$ is (topologically) reconstructible if whenever…