12 research outputs found

    Transversals and colorings of simplicial spheres

    Full text link
    Motivated from the surrounding property of a point set in Rd\mathbb{R}^d introduced by Holmsen, Pach and Tverberg, we consider the transversal number and chromatic number of a simplicial sphere. As an attempt to give a lower bound for the maximum transversal ratio of simplicial dd-spheres, we provide two infinite constructions. The first construction gives infintely many (d+1)(d+1)-dimensional simplicial polytopes with the transversal ratio exactly 2d+2\frac{2}{d+2} for every d≥2d\geq 2. In the case of d=2d=2, this meets the previously well-known upper bound 1/21/2 tightly. The second gives infinitely many simplicial 3-spheres with the transversal ratio greater than 1/21/2. This was unexpected from what was previously known about the surrounding property. Moreover, we show that, for d≥3d\geq 3, the facet hypergraph F(K)\mathcal{F}(\mathsf{K}) of a dd-dimensional simplicial sphere K\mathsf{K} has the chromatic number χ(F(K))∈O(n⌈d/2⌉−1d)\chi(\mathcal{F}(\mathsf{K})) \in O(n^{\frac{\lceil d/2\rceil-1}{d}}), where nn is the number of vertices of K\mathsf{K}. This slightly improves the upper bound previously obtained by Heise, Panagiotou, Pikhurko, and Taraz.Comment: 22 pages, 2 figure

    Realization spaces of arrangements of convex bodies

    Get PDF
    We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial complexity of the bodies and the topological complexity of their realization space. First, we show that every combinatorial type is realizable and its realization space is contractible under mild assumptions. Second, we prove a universality theorem that says the restriction of the realization space to arrangements polygons with a bounded number of vertices can have the homotopy type of any primary semialgebraic set

    A point in a ndnd n d -polytope is the barycenter of nn n points in its dd d -faces

    No full text
    corecore