Let K be a simplicial complex with vertex set V = v1,…,vn. The complex K is d-representable if there is a collection {C1,…,Cn} of convex sets in Rd such that a subcollection {Ci1,…,Cij} has a nonempty intersection if and only if {vi1,…,vij} is a face of K.In 1967 Wegner proved that every simplicial complex of dimension d is (2d+1)-representable. He also conjectured that his bound is the best possible, i.e., that there are d-dimensional simplicial complexes which are not 2d-representable. However, he was not able to prove his conjecture.We prove that his suggestion was indeed right. Thus we add another piece to the puzzle of intersection patterns of convex sets in Euclidean space
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
In this paper, we describe and analyze several representations for complex shapes, i.e., multi-dimen...
We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed...
<p>Let <strong>K</strong> be a simplicial complex with vertex set <em>V</em> = <em>v</em><sub>1</sub...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
We show that an abstract simplicial complex \Delta may be realized on a grid of \mathbb{R}^{d-1}, wh...
We show that an abstract simplicial complex \Delta may be realized on a grid of \mathbb{R}^{d-1}, wh...
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstr...
1 Topological and Geometrical Combinatorics Martin Tancer Abstract The task of the thesis is to pres...
It is proved that the fundamental groups of boolean representable simplicial complexes (BRSC) are fr...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
In this paper, we describe and analyze several representations for complex shapes, i.e., multi-dimen...
We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed...
<p>Let <strong>K</strong> be a simplicial complex with vertex set <em>V</em> = <em>v</em><sub>1</sub...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
We show that an abstract simplicial complex \Delta may be realized on a grid of \mathbb{R}^{d-1}, wh...
We show that an abstract simplicial complex \Delta may be realized on a grid of \mathbb{R}^{d-1}, wh...
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstr...
1 Topological and Geometrical Combinatorics Martin Tancer Abstract The task of the thesis is to pres...
It is proved that the fundamental groups of boolean representable simplicial complexes (BRSC) are fr...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
In this paper, we describe and analyze several representations for complex shapes, i.e., multi-dimen...
We consider the following decision problem EMBEDk→d in computational topology (where k ≤ d are fixed...