A Combinatorial Approach to Colourful Simplicial Depth

Abstract

ABSTRACT. The colourful simplicial depth conjecture states that any point in the convex hull of each of d +1 sets, or colours, of d +1 points in general position in R d is contained in at least d 2 +1 simplices with one vertex from each set. We verify the conjecture in dimension 4 and strengthen the known lower bounds in higher dimensions. These results are obtained using a combinatorial generalization of colourful point configurations called octahedral systems. We present properties of octahedral systems generalizing earlier results on colourful point configurations and exhibit an octahedral system which cannot arise from a colourful point configuration. The number of octahedral systems is also given.1. INTRODUCTION 1.1. Preliminaries. An n-uniform hypergraph is said to be n-partite if its vertex set is the disjoint union of n sets V 1 , . . . ,V n and each edge intersects each V i at exactly one vertex. Such an hypergraph is an (n + 1)-tuple (V 1 , . . . ,V n , E ) where E is the set of edges. An octahedral system Ω is an n-partite hypergraph (V 1 , . . . ,V n , E ) with |V i | ≥ 2 for i = 1, . . . , n and satisfying the following parity condition: the number of edges of Ω induced by X ⊆is a collection of d + 1 sets, or colours, S 1 , . . . , S d +1 . A colourful simplex is defined as the convex hull of a subset S ofS i of points such that |X ∩ S i | = 2 for i = 1, . . . , d + 1, there is an even number of colourful simplices generated by X and containing the origin 0. Therefore, the hypergraph Ω = (V 1 , . . . ,V d +1 , E ), with V i = S i for i = 1, . . . , d + 1 and where the edges in E correspond to the colourful simplices containing 0 forms an octahedral system. This property motivated Bárány to suggest octahedral systems as a combinatorial generalization of colourful point configurations, see [8].Let µ(d ) denote the minimum number of colourful simplices containing 0 over all colourful point configurations satisfying 0 ∈ Subsequently, Bárány and Matoušek [3] verified the conjecture for d = 3 and provided a lower bound of . The lower bound was slightly improved in dimension 4 to µ(4) ≥ 14 via a computational approach presented in [9].An octahedral system arising from a colourful point configuration S 1 , . . . ,conv(S i ) and |S i | = d + 1 for all i , is without isolated vertex; that is, each vertex belongs to at least one edge. Indeed, according to a strengthening of the colourful Carathéodory theorem [2], any point of such a colourful configuration is the vertex of at least one colourful simplex containing 0. Theorem 1.1, whose proof is given in Section 4, provides a lower bound for the number of edges of an octahedral system without isolated vertex. Bárány's sufficient condition for the existence of a colourful simplex containing 0 has been recently generalized in [1,11,14]. The related algorithmic question of finding a colourful simplex containing 0 is presented and studied in [4,7]. For a recent breakthrough for a monocolour version [10, 13]. Definitions. Let E [X ] denote the set of edges induce...

The colourful simplicial depth conjecture

“…The following proposition, proved in [6], states that the set of all octahedral systems is stable under the "symmetric difference" operation. Proposition 1.…”

“…Deza et. al [6] improved the bound to 1 2 d 2 + 7 2 d − 8 for d ≥ 4. This latter result was obtained using a combinatorial generalization of the colourful point configurations suggested by Bárány and known as octahedral systems, see [5].…”

Colorful Simplicial Depth, Minkowski Sums, and Generalized Gale Transforms

“…The initial lower bound of 2d from [7] was improved in a series of papers [4,8,9,26] culminating in the resolution of the conjectured lower bound by Sarrabezolles [24]. In [7] also a conjectured upper bound was proposed.…”