Related papers: Linear embeddings of contractible and collapsible …
We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…
Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the…
We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…
Firstly, we characterise the embeddability of simply connected locally 3-connected 2-dimensional simplicial complexes in 3-space in a way analogous to Kuratowski's characterisation of graph planarity, by nine excluded minors. This answers…
We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…
A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…
This paper is the last paper in a series of five papers. Building on earlier papers in this series, we prove an analogue of Kuratowski's characterisation of graph planarity for three dimensions. More precisely, a simply connected…
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…
We prove that over an algebraically closed field there is a representation embedding from the category of classical Kronecker-modules without the simple injective into the category of finite-dimensional modules over any…
A general position map $f:K\to M$ of a $k$-dimensional simplicial complex to a $2k$-dimensional manifold (for $k=1$, of a graph to a surface) is a $\mathbb Z_2$-embedding if $|f\sigma \cap f\tau|$ is even for any non-adjacent $k$-faces…
We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…
For $X \sim X(n; 1, n^{-\alpha_1}, n^{-\alpha_2}, ...)$ in the multiparameter random simplicial complex model we establish necessary and sufficient strict inequalities on the $\alpha_i$'s to linearly embed the complex into…
We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…
Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…
We study the potentially undecidable problem of whether a given 2-dimensional CW complex can be embedded into $\mathbb{R}^4$. We provide operations that preserve embeddability, including joining and cloning of 2-cells, as well as…
These notes loosely follow an introductory course on graph complexes, held at Humboldt-Universit\"at zu Berlin in summer 23. Instead of simply typing up my lecture notes I decided to give here an overview over (parts of) the topic (lecture…
We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a…
We construct a number of topologically trivial but smoothly non-trivial families of embeddings of 3-manifolds in 4-manifolds. These include embeddings of homology spheres in $S^4$ that are not isotopic but have diffeomorphic complements,…
We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…
It is shown that a simple graph which is embeddable in the real projective plane is minimally 3-rigid if and only if it is (3,6)-tight. Moreover the topologically uncontractible embedded graphs of this type are constructible from one of 8…