Abstract
Let S be a kcolored (finite) set of n points in \(\mathbb{R}^{d}\), d≥3, in general position, that is, no (d+1) points of S lie in a common (d−1)dimensional hyperplane. We count the number of empty monochromatic dsimplices determined by S, that is, simplices which have only points from one color class of S as vertices and no points of S in their interior. For 3≤k≤d we provide a lower bound of \(\varOmega(n^{dk+1+2^{d}})\) and strengthen this to Ω(n ^{d−2/3}) for k=2.
On the way we provide various results on triangulations of point sets in \(\mathbb{R}^{d}\). In particular, for any constant dimension d≥3, we prove that every set of n points (n sufficiently large), in general position in \(\mathbb{R}^{d}\), admits a triangulation with at least dn+Ω(logn) simplices.
Introduction
Let S be a finite set of n points in \(\mathbb{R}^{d}\). Throughout this paper we assume that S is in general position, that is, no (d+1) points of S lie in a common (d−1)dimensional hyperplane. A more formal definition of “general position” can be found in Sect. 2.1. A subset S′ of S is said to be empty if \(\operatorname{Conv}(S') \cap S=S'\), where \(\operatorname{Conv}(S')\) denotes the convex hull of S′ (please see Sect. 2.1 for a detailed definition). A kcoloring of S is a partition of S into k nonempty sets called color classes. A subset of S is said to be monochromatic if all its elements belong to the same color class. A dsimplex is the ddimensional version of a triangle.
The problem of determining the minimum number of empty triangles any set of n points in general position in the plane contains, has been widely studied [3, 9, 12, 19] and also the higher dimensional version of the problem has been considered [2]. In [12] it is noted that every set of n points in general position in \(\mathbb{R}^{d}\) determines at least \(\binom{n1}{d}=\varOmega(n^{d})\) empty simplices. In [2] it is shown that in a random set of n points in \(\mathbb{R}^{d}\)—chosen uniformly at random on a convex, bounded set with nonempty interior—the expected number of empty simplices is at most \(c_{d} \binom{n}{d}=O(n^{d})\) (where c _{ d } is a constant depending only on d).
The colored version of the problem has been introduced in [7] and was studied in [1], where Ω(n ^{5/4}) empty monochromatic triangles were shown to exist in every two colored set of n points in general position in the plane. This has later been improved to Ω(n ^{4/3}) in [15]. Further, arbitrarily large 3colored sets without empty monochromatic triangles were shown to exist in the plane in [7].
In this paper we study the higher dimensional version of this colored variant. We generalize both, the dimension and the number of colors. Specifically, we consider the problem of counting the number of empty monochromatic dsimplices in a kcolored set of points in \(\mathbb{R}^{d}\).
It is shown in [18] that every sufficiently large 4colored set of points in general position in \(\mathbb{R}^{3}\) contains an empty monochromatic tetrahedron. This is done by showing that any set of n points in general position in \(\mathbb{R}^{3}\) can be triangulated with more than 3n tetrahedra.
The problem of triangulating a set of points with many simplices is intimately related to the problem of determining the minimum number of empty simplices in kcolored sets of points in \(\mathbb{R}^{d}\). Remarkably this problem has received little attention. For the special case of \(\mathbb{R}^{3}\), it even has been pronounced “the least significant” among the four extremal (maxmax, maxmin, minmax, minmin) problems in [10]. Consequently, only a trivial lower bound and an upper bound of \(\frac{7}{15}n^{2}+O(n)\) has been shown there. Nevertheless, in [5] sets of n points in \(\mathbb{R}^{d}\) in general position are shown such that every triangulation of them has O(n ^{5/3}) tetrahedra, for points in \(\mathbb{R}^{3}\), and in general O(n ^{1/d+⌈d/2⌉⋅(d−1)/d}) simplices for points in \(\mathbb{R}^{d}\). Furthermore, in [6] this minmax problem is stated as Open Problem 11 in the section “Extremal Number of Special Subconfigurations”.
In this direction we give the first, although not asymptotically improving, nontrivial lower bound and show that for d≥3 every set of n points in general position in \(\mathbb{R}^{d}\) admits a triangulation of at least dn+Ω(logn) simplices, for n sufficiently large and d constant.
The paper is organized as follows: in Sect. 2, known results on simplicial complexes and triangulations are reviewed; in Sect. 3, new results on simplicial complexes and triangulations are presented; using these results in Sect. 4, highdimensional versions of the Order and Discrepancy Lemmas used in [1] are shown; in Sect. 5, the lemmas of Sect. 4 are put together to prove various results on the minimum number of empty monochromatic simplices in sets of points in \(\mathbb{R}^{d}\). Our results are summarized in Table 1.
To provide a better general view on the paper, and especially to visualize the interrelation between the many lemmas, we present a “roadmap” through the paper in Fig. 1. The lemmas (and theorems and corollaries) are shown in boxes, given with their number, if applicable a special name, and the necessary preconditions. Main results have a bold frame. The lemmas are grouped to reflect their topical and section correlation. An arrow from a Lemma A to a Lemma B depicts, that the proof of Lemma B uses the result of Lemma A. Theorem 35 (stated and proven in the Conclusions section) is not depicted in Fig. 1, as there is no interrelation with other lemmas.
Preliminaries
In this section, following the notation of Matoušek [13], we state the definitions and known results regarding simplicial complexes and triangulations, that will be needed throughout the paper. Note that in this paper we consider the number, d, of dimensions and also the number, k, of different colors as constants. This means, that d and k do not depend on the size, n, of the considered finite set of points. But of course the required minimum size of the point set might depend on d and k.
Simplicial Complexes
Let X be a finite set of points in \(\mathbb{R}^{d}\). The convex hull of X, denoted by \(\operatorname{Conv}(X)\), is the intersection of all convex sets containing X. Alternatively, it may be defined as the set of points that can be written as a convex combination of elements of X:
We denote the boundary of \(\operatorname{Conv}(X)\) with \(\operatorname {CH}(X)\). A point of X is said to be a convex hull point if it lies in \(\operatorname{CH}(X)\), otherwise it is called an interior point. A point set X is said to be in convex position if every point of X is a convex hull point.
Let 0 denote the ddimensional zero vector. A set of points {x _{1},…,x _{ n }} in \(\mathbb{R}^{d}\) is said to be affinely dependent if there exist real numbers (α _{1},…,α _{ n }), not all zero, such that \(\sum_{i=1}^{n} \alpha_{i}x_{i}=\mathbf{0}\) and \(\sum_{i=1}^{n} \alpha_{i}=0\). Otherwise {x _{1},…,x _{ n }} is said to be affinely independent. A set of points X in \(\mathbb{R}^{d}\) is in general position if each subset of X with at most d+1 elements is affinely independent.
A simplex σ is the convex hull of a finite affinely independent set A in \(\mathbb{R}^{d}\). The elements of A are called the vertices of σ. If A consists of m+1 elements, we say that σ is of dimension dimσ:=m or that σ is an msimplex. The convex hull of any subset of vertices of a simplex σ is called a face of σ. A face of a simplex is again a simplex.
A simplicial complex \(\mathcal{K}\) is a family of simplices satisfying the following properties:

Each face of every simplex in \(\mathcal{K}\) is also a simplex of \(\mathcal{K}\).

The intersection of two simplices \(\sigma_{1}, \sigma_{2} \in \mathcal{K}\) is either empty or a face of both, σ _{1} and σ _{2}.
The vertex set of \(\mathcal{K}\) is the union of the vertex sets of all simplices in \(\mathcal{K}\). We say that \(\mathcal{K}\) is of dimension m, if m is the highest dimension of any of its simplices. The size of a simplicial complex of dimension m is the number of its simplices of dimension m. The jskeleton of \(\mathcal{K}\) is the simplicial complex consisting of all simplices of \(\mathcal{K}\) of dimension at most j. Hence the 0skeleton is the vertex set of \(\mathcal{K}\).
We now turn to finite sets of points in general position in \(\mathbb{R}^{d}\). Let S be such a set of n elements. Note that since S is in general position we may regard \(\operatorname {CH}(S)\) as a simplicial complex in a natural way. Such simplicial complexes are called simplicial polytopes. It is known that every simplicial polytope satisfies:
Theorem 1
([4] Lower Bound Theorem)
For a simplicial polytope of dimension d let f _{ m } be the number of its mdimensional faces. Then:

\(f_{m} \ge\binom{d}{m}f_{0}\binom{d+1}{m+1}m\) for all 1≤m≤d−2 and

f _{ d−1}≥(d−1)f _{0}−(d+1)(d−2).
Note that in the Lower Bound Theorem, the word dimension refers to the dimension of the simplicial polytope as a polytope. Hence, a three dimensional simplicial polytope would be a two dimensional simplicial complex.
Triangulations
A triangulation \(\mathcal{T}\) of S is a simplicial complex such that its vertex set is S and the union of all simplices of \(\mathcal{T}\) is \(\operatorname{Conv}(S)\). This definition generalizes the usual definition of triangulations of planar point sets. The size of a triangulation is the number of its dsimplices. The minimum size of any triangulation of S is known to be n−d. We explicitly mention this result for further use:
Theorem 2
[16]
Every triangulation of a set of n points in general position in \(\mathbb{R}^{d}\) has size at least n−d.
We will use the following operation of inserting a point p into a triangulation \(\mathcal{T}\) frequently: Let p be a point not in S but such that S∪{p} is also in general position, and let \(\mathcal{T}\) be a triangulation of S. If p lies in \(\operatorname{Conv}(S)\) then p is contained in a unique dsimplex σ of \(\mathcal{T}\). We remove σ from \(\mathcal{T}\) and replace it with the (d+1) dsimplices formed by taking the convex hull of p and each of the (d+1) (d−1)dimensional faces of σ. If, on the other hand, p lies outside \(\operatorname{Conv}(S)\) then a set \(\mathcal{F}\) of (d−1)dimensional faces of \(\operatorname{CH}(S)\) is visible from p. We get a set of dsimplices formed by taking the convex hull of p and each face of \(\mathcal{F}\), and add these simplices to \(\mathcal{T}\). In either case the resulting family of simplices is a triangulation of S∪{p} (see Fig. 2).
We distinguish two different types of triangulations of a set S of n points in general position in \(\mathbb{R}^{d}\) by their construction: A shelling triangulation of S is constructed as follows. Choose any ordering p _{1},p _{2},…,p _{ n } of the elements of S and let S _{ i }={p _{1},…,p _{ i }}. Start by triangulating S _{ d+1} with only one simplex. Afterwards, for every i>d+1 create the triangulation of S _{ i } by inserting p _{ i } into the triangulation of S _{ i−1}. The final triangulation of this process, that of S _{ n }, is a shelling triangulation. A pulling triangulation of S is constructed by choosing (if it exists) a point p of S, such that \(S\setminus((\operatorname{CH}(S)\cap S)\cup\{p\} )=\emptyset\). Then S∖{p} is in convex position. Construct a dsimplex with p and each (d−1)dimensional face of \(\operatorname{CH}(S)\) that does not contain p.
Results on Triangulations and Simplicial Complexes
In this section we present some results on triangulations and simplicial complexes that will be needed later, but are also of independent interest. We begin by showing that every point set can be triangulated with a “large number” of simplices. We use the same strategy as in [18].
Large Sized Triangulations
First we prove a lower bound on the size for a triangulation of a convex set of points, by building a shelling triangulation for a special sequence of points.
Lemma 3
Every set S of n>d(d+1) points in convex and general position in \(\mathbb{R}^{d}\) (d>2) has a triangulation of size at least (d+1)n−c _{ d }, with c _{ d }=d ^{3}+d ^{2}+d.
Proof
The 1skeleton of \(\operatorname{CH}(S)\) is a graph of n vertices and, by the Lower Bound Theorem (Theorem 1, for m=1), of at least \(dn\frac{d(d+1)}{2}\) edges. Therefore, as long as n>d(d+1) there will be a vertex of degree at least 2d in this graph.
Set S _{ n }:=S and let G _{ n } be the 1skeleton (as a graph) of \(\operatorname{CH}(S_{n})\). In general once S _{ i } is defined, let G _{ i } be the 1skeleton (as a graph) of \(\operatorname {CH}(S_{i})\). Let p _{ i } be a vertex of degree at least 2d in G _{ i }, with n≥i>d(d+1). We construct a shelling triangulation \(\mathcal{T}_{n}\) of S _{ n }, with size as claimed in the lemma.
Starting with S _{ n }, iteratively remove a vertex p _{ i } from S _{ i }, i.e., S _{ i−1}=S _{ i }∖{p _{ i }}. Observe that S _{ i }=i. The iteration stops with S _{ i−1}=S _{ d(d+1)} as i>d(d+1). Construct an arbitrary shelling triangulation \(\mathcal{T}_{d(d+1)}\) of S _{ d(d+1)}. By Theorem 2, \(\mathcal{T}_{d(d+1)}\) has size at least d(d+1)−d=d ^{2}. Complete \(\mathcal{T}_{d(d+1)}\) to a shelling triangulation \(\mathcal{T}_{n}\) by inserting the points p _{ i } in reversed order of their removal (i from d(d+1)+1 to n).
We prove that with each inserted point p _{ i } at least (d+1) dsimplices are added to the triangulation. Let ϱ _{ i } be the degree of p _{ i } in G _{ i } and recall that ϱ _{ i }≥2d. Consider the neighbors \(q_{1},\dots,q_{\varrho_{i}}\) of p _{ i } in G _{ i }. Let Π be a (d−1)dimensional hyperplane separating p _{ i } and S _{ i−1}, and let \(q_{1}',\dots,q_{\varrho_{i}}'\) be the set of intersections of Π with the lines spanned by p _{ i } and each of \(q_{1},\dots,q_{\varrho_{i}}\).
Note that \(q_{1}',\dots,q_{\varrho_{i}}'\) are a set of points in convex position in \(\mathbb{R}^{d1}\) and that the (d−1)dimensional faces of \(\operatorname{CH}(S_{i1})\), which are visible to p _{ i }, project to a triangulation of \(q_{1}',\dots,q_{\varrho_{i}}'\) in Π. By Theorem 2, every triangulation of ϱ _{ i } points in \(\mathbb{R}^{d1}\) has size at least ϱ _{ i }−(d−1)≥d+1. Thus, at least (d+1) dsimplices are added when inserting p _{ i }. Hence, the constructed shelling triangulation \(\mathcal{T}_{n}\) has size at least d ^{2}+(d+1)(n−d(d+1)), which is the claimed bound of (d+1)n−c _{ d }, with c _{ d }=d(d+1)^{2}−d ^{2}=d ^{3}+d ^{2}+d. □
Using this result it is easy to give a lower bound on the triangulation size for general point sets in dependence of a certain subset property.
Lemma 4
Let S be a set of points in general position in \(\mathbb{R}^{d}\) (d>2). Let P and Q be two disjoint sets, such that S=P∪Q and Q is in convex position. If Q>d(d+1) then there exists a triangulation of S of size at least (d+1)Q+P−c _{ d }, with c _{ d } defined as in Lemma 3.
Proof
By Lemma 3, Q has a triangulation \(\mathcal{T}\) of size at least (d+1)Q−c _{ d }, if Q>d(d+1). Inserting each point of P into \(\mathcal{T}\) adds at least one dsimplex to \(\mathcal{T}\) per point in P. This results in a triangulation of S with size at least (d+1)Q+P−c _{ d }. □
Combining the previous two lemmas we prove a new nontrivial lower bound for the size of triangulations with an additive logarithmic term.
Theorem 5
Every set S of \(n>4^{d^{2}(d+1)}\) points in general position in \(\mathbb{R}^{d}\) (d>2), with h convex hull points, has a triangulation of size at least \(dn+\max{ \{h,\frac{\log_{2}(n)}{2d} \}}c_{d}\), with c _{ d } as defined in Lemma 3.
Proof
Let P be the set of convex hull points of S. We distinguish two cases:

P=h>log_{2}(n)/(2d). By Lemma 3, there exists a triangulation of P of size at least (d+1)h−c _{ d }, as h>d(d+1). Insert the remaining n−h points of S∖P into this triangulation. Since these points are inside \(\operatorname{Conv}(P)\), each of them contributes with d additional dsimplices to the final triangulation. Therefore, the resulting triangulation has size at least \(dn+hc_{d} > dn+\frac{\log_{2}(n)}{2d}c_{d}\).

P=h≤log_{2}(n)/(2d). By the Erdős–Szekeres Theorem (see [11]) and its best known upper bound (see [17]), S contains a subset Q of at least
$$Q > \frac{\log_2(n)}{2} > d(d+1) $$points in convex position. Let P′=P∖Q. Apply Lemma 4 to obtain a triangulation \(\mathcal{T}\) of P′∪Q of size at least (d+1)Q+P′−c _{ d }. Insert the remaining points of S∖(P′∪Q) into \(\mathcal{T}\). Since these inserted points are in the interior of \(\operatorname {Conv}(P' \cup Q)\), each of them contributes with d additional dsimplices to the final triangulation. Therefore, this triangulation has size at least
$$\begin{aligned}[c] & d\bigl(nQ\biglP'\bigr\bigr) +(d+1)Q+\biglP'\bigrc_d \\ & \quad = dn+Q(d1)\biglP'\bigrc_d > dn+\frac{\log_2(n)}{2}(d1)\frac{\log_2(n)}{2d}c_d \\ &\quad \geq dn+\frac{\log_2(n)}{2}\frac{\log_2(n)}{2}+\frac{\log_2(n)}{2d}c_d, \end{aligned} $$which is \(dn+\frac{\log_{2}(n)}{2d}c_{d}\). □
Note that c _{ d } in Lemma 3 can be improved to \(\frac{d(d+1)^{2}}{2}+\frac{d(d+1)}{12} = \frac{d^{3}}{2}+\frac{13d^{2}}{12}+\frac{7d}{12}\). Instead of stopping the process at S _{ d(d+1)}, we continue the iteration using a vertex of degree 2d−1 for S _{ i } with \(d(d+1)\geq i > \frac{d(d+1)}{2}\), a vertex of degree 2d−2 for S _{ i } with \(\frac{d(d+1)}{2}\geq i > \frac{d(d+1)}{3}\), and so on. This way, instead of a triangulation of size at least d ^{2}, we can guarantee a triangulation \(\mathcal{T}_{d(d+1)}\) of size at least
which results in the claimed improvement of c _{ d } for d≥3. Thus, for d=3 Theorem 5 can be improved to \(3n+\max{ \{h,\frac{\log_{2}{n}}{6} \}}25\). Note that this corresponds to the bound from [10], that every set of n points in general position in \(\mathbb{R}^{3}\), with h convex hull points, has a tetrahedralization of size at least 3(n−h)+4h−25 for h≥13.
Pulling Complexes
Let S be a set of n points in general position in \(\mathbb{R}^{d}\). In this section we present lemmas that allow us to construct dsimplicial complexes of large size on S, such that their dsimplices contain a prespecified subset of S in their vertex set. We begin with a result for point sets, whose convex hull is a simplex.
Lemma 6
Let S be a set of n≥d+1 points in general position in \(\mathbb{R}^{d}\) (d≥1), such that \(\operatorname{Conv}(S)\) is a dsimplex. For every convex hull point p of S, there exists a triangulation of S such that (d−1)n−d ^{2}+2 of its dsimplices have p as a vertex.
Proof
We use induction on n, see Fig. 3 for an illustration. Start with a triangulation \(\mathcal{T}\) consisting only of the dsimplex \(\operatorname{Conv}(S)\). If n=(d+1), \(\mathcal{T}\) is a triangulation with (d−1)n−d ^{2}+2=(d−1)(d+1)−d ^{2}+2=1 empty simplex containing p as vertex.
Assume n>d+1. Let q be the interior point of S closest to the only face of \(\operatorname{Conv}(S)\) not incident to p. (If there exist more then one such closest points, then choose an arbitrary one of them as q.) Insert q into \(\mathcal{T}\). This results in a triangulation of size (d+1) in which d of its dsimplices, σ _{1}…σ _{ d }, have p as a vertex. Note that the remaining dsimplex does not contain any point of S in its interior. We apply induction on σ _{1}…σ _{ d }. Let n _{ i } (1≤i≤d) be the number of points of S interior to σ _{ i }, \(\sum_{i=1}^{d} n_{i} = n  (d+1)  1\). For each σ _{ i } we obtain a triangulation such that (d−1)(n _{ i }+(d+1))−d ^{2}+2 of its dsimplices have p as a vertex. The union of the triangulations of each σ _{ i } is a triangulation of S, and
of its dsimplices have p as a vertex. □
The next three lemmas give, for every point of a general point set in \(\mathbb{R}^{d}\), a lower bound on the number of interior disjoint dsimplices incident to p, for the cases d=2, d=3, and d>3, respectively.
Lemma 7
Let S be a set of n≥3 points in general position in \(\mathbb{R}^{2}\). For every point p of S there exists a 2dimensional simplicial complex of size at least (n−2) and such that all of its triangles have p as a vertex.
Proof
Do a cyclic ordering around p of the points of S∖{p}. Construct a 2dimensional simplicial complex by forming a triangle with p and every two consecutive elements determining an angle less than π. This simplicial complex has at least n−2 triangles and they all contain p as a vertex. □
Lemma 8
Let S be a set of n≥4 points in general position in \(\mathbb{R}^{3}\). For every point p of S there exists a triangulation of S such that at least:

2n−6 of its 3simplices have p as a vertex, if p is an interior point of S.

2n−ϱ(p)−4 of its 3simplices contain p as a vertex, if p is a convex hull point of S and ϱ(p) is its degree in the 1skeleton of \(\operatorname{CH}(S)\).
Proof
Let S′ be the set of convex hull points of S and n′=S′. Construct a pulling triangulation \(\mathcal{T}'\) w.r.t. p of S′∪{p}. By definition all 3simplices of \(\mathcal{T}'\) contain p as a vertex. For every 3simplex σ of \(\mathcal{T}'\), let η be the number of points of S interior to σ. By applying Lemma 6 we can triangulate σ, such that 2(η+4)−7=2η+1 of its 3simplices have p as a vertex. Repeat this for every 3simplex of \(\mathcal{T}'\), to obtain a triangulation \(\mathcal{T}\) of S.
By Theorem 1, \(\operatorname{CH}(S)\) has (at least) 2n′−4 faces. For d=3 this lower bound is tight.

If p is an interior point of S, \(\mathcal{T}'\) contains a 3simplex for every face of \(\operatorname{CH}(S)\). Therefore, summing over all these faces we get
$$\sum(2\eta+1) = 2\sum (\eta)+2n'4 = 2\bigl(nn'1\bigr)+2n'4 = 2n6 $$of the 3simplices in \(\mathcal{T}\) have p as a vertex.

If p is a convex hull point of S, \(\mathcal{T}'\) contains a 3simplex for every face of \(\operatorname{CH}(S)\) not having p as a vertex. This is equal to 2n′−4−ϱ(p), where ϱ(p) is the degree of p in the 1skeleton of \(\operatorname{CH}(S)\). Therefore,
$$\begin{aligned}[c] \sum(2\eta+1) & = 2\sum(\eta)+2n'4\varrho(p) = 2 \bigl(nn'\bigr)+2n'4\varrho(p) \\ & = 2n\varrho(p)4 \end{aligned} $$of the 3simplices in \(\mathcal{T}\) have p as a vertex. □
Lemma 9
Let S be a set of \(n>4^{d^{2}(d+1)}\) points in general position in \(\mathbb{R}^{d}\) (d>3). For every point p of S, there exists a ddimensional simplicial complex \(\mathcal{K}\) with vertex set S, such that \(\mathcal{K}\) has size strictly larger than \((d1)n+\frac{\log_{2} n}{2(d1)}2c_{d1}\) and all its dsimplices have p as a vertex, with c _{ d } defined as in Lemma 3.
Proof
For every point q∈S distinct from p let r _{ q } be the infinite ray with origin p and passing through q. Let Π be a halving (d−1)dimensional hyperplane of S passing through p, not containing any other point of S. Further, let Π _{1} and Π _{2} be two (d−1)dimensional hyperplanes parallel to Π containing \(\operatorname{Conv}(S)\) between them and not parallel to any of the rays r _{ q }.
Project from p every point in S∖{p} to Π _{1} or Π _{2}, in the following way. Every ray r _{ q } intersects either Π _{1} or Π _{2} in a point q′. Take q′ to be the projection of q from p. Let \(S_{1}'\) and \(S_{2}'\) be these projected points in Π _{1} and Π _{2}, respectively. Both, \(S_{1}'\) and \(S_{2}'\), are sets of points in general position in \(\mathbb{R}^{d1}\), with \(S_{1}'=n_{1}= \lfloor\frac{n1}{2} \rfloor\) and \(S_{2}'=n_{2}= \lceil\frac{n1}{2} \rceil\), where both, n _{1} and n _{2}, are strictly larger than \(4^{(d1)^{2}d}\).
By Theorem 5, there exist triangulations \(\mathcal{T}_{1}\) of \(S_{1}'\) and \(\mathcal{T}_{2}\) of \(S_{2}'\) of size at least \((d1)n_{1}+\frac{\log_{2}(n_{1})}{2(d1)}c_{d1}\) and \((d1)n_{2}+\frac{\log_{2}(n_{2})}{2(d1)}c_{d1}\), respectively. Consider the simplicial complexes \(\mathcal{K}_{1}\) and \(\mathcal{K}_{2}\) that arise from replacing every point q′ in a simplex of \(\mathcal{T}_{1}\) or \(\mathcal{T}_{2}\) with its preimage q in S∖{p}. The (d−1)simplices of \(\mathcal{K}_{1}\) and \(\mathcal{K}_{2}\) are all visible from p. Hence, we obtain a simplicial complex \(\mathcal{K}\) of dimension d, by taking the convex hull of p and each (d−1)simplex of \(\mathcal{K}_{1}\) and \(\mathcal{K}_{2}\). Obviously, all dsimplices of \(\mathcal{K}\) contain p as a vertex. The size of \(\mathcal{K}\) is at least
This is strictly larger than \((d1)n+\frac{\log_{2}(n)}{2(d1)}2c_{d1}\). □
We now consider not only one point, but subsets X of point sets in \(\mathbb{R}^{d}\) (d>3). The next three lemmas, applicable for 1≤X≤d−3, X=d−1, and X=d−2, respectively, provide lower bounds on the number of interior disjoint dsimplices which all share the points in X. Note that the second lemma in the row, Lemma 11, is true for d≥3.
Lemma 10
Let S be a set of \(n>4^{d^{2}(d+1)}\) points in general position in \(\mathbb{R}^{d}\) (d>3). For every set X⊂S of r points (1≤r≤d−3), there exists a ddimensional simplicial complex \(\mathcal{K}\) with vertex set S, such that \(\mathcal{K}\) has size strictly larger than \((dr)n+\frac{\log_{2} n}{2(dr)}2c_{d1}\) and all its dsimplices have X in their vertex set, with c _{ d } defined as in Lemma 3.
Proof
The case r=1 is shown in Lemma 9. Thus assume that r>1. Let Π be the (r−1)dimensional hyperplane containing X and let Π′ be a (d−(r−1))dimensional hyperplane orthogonal to Π. Project S orthogonally to Π′, and let S′ be the resulting image. The set X is projected to a single point p _{ X } in Π′. Obviously \(S' = nr+1 > 4^{(dr+1)^{2}(dr+2)}\). Apply Lemma 9 to S′, and obtain a (d−r+1)dimensional simplicial complex \(\mathcal{K}'\) with vertex set S′ of size at least
such that all the (d−r+1)simplices of \(\mathcal{K}'\) have p _{ X } as a vertex.
To get \(\mathcal{K}\) from \(\mathcal{K}'\), lift each simplex of \(\mathcal{K}'\) to the convex hull of the preimage of its vertex set. Thus \(\mathcal{K}\) is a ddimensional simplicial complex with vertex set S and size larger than \((dr)n+\frac{\log_{2} n}{2(dr)}2c_{d1}\). As all (d−r+1)simplices of \(\mathcal{K}'\) have p _{ X } as a vertex, each dsimplex of \(\mathcal{K}\) has X as a vertex subset. □
Lemma 11
Let S be a set of n>d points in general position in \(\mathbb{R}^{d}\) (d≥3). For every set X⊂S of d−1 points, there exists a ddimensional simplicial complex \(\mathcal{K}\) with vertex set S, such that \(\mathcal{K}\) has size at least n−d, and all dsimplices of \(\mathcal{K}\) have X in their vertex set.
Proof
The proof is similar to that of Lemma 10, with the difference that we cannot apply Lemma 9.
Let Π be the (d−2)dimensional hyperplane containing X and let Π′ be a 2dimensional hyperplane orthogonal to Π. Project S orthogonally to Π′, and let S′ be its image. The set X is projected to a single point p _{ X } of Π′ (see Fig. 4). Obviously S′=n−d+2≥3. Apply Lemma 7 to S′, and obtain a 2dimensional simplicial complex \(\mathcal{K}'\) with vertex set S′ of size at least (n−d+2)−2=n−d, such that all triangles of \(\mathcal{K}'\) have p _{ X } as a vertex.
To get \(\mathcal{K}\) from \(\mathcal{K}'\), lift each triangle of \(\mathcal{K}'\) to the convex hull of the preimage of its vertex set. Thus \(\mathcal{K}\) is a ddimensional simplicial complex with vertex set S and size n−d. Since all triangles of \(\mathcal{K}'\) have p _{ X } as a vertex, all dsimplices of \(\mathcal{K}\) have X as a vertex subset. □
Note that Lemmas 10 and 11 leave a gap for r=d−2. In this case, the point set is projected to a 3dimensional hyperplane, where the guaranteed bounds on incident 3simplices vary significantly for extremal and interior points, see Lemma 8. Thus we make a weaker statement for this case, which will turn out to be sufficient anyhow.
Lemma 12
Let S be a set of n>d+5 points in general position in \(\mathbb{R}^{d}\) (d>3). Let X⊂S be a subset of d−2 points. Denote with Π the (d−3)dimensional hyperplane containing X and with Π′ a 3dimensional hyperplane orthogonal to Π. Project S orthogonally to Π′, and let S′ be the resulting image. The set X is projected to a single point p _{ X } in Π′.
If p _{ X } is an interior point of S′, then there exists a ddimensional simplicial complex \(\mathcal{K}\) with vertex set S, such that \(\mathcal{K}\) is of size at least 2n−2d−8 and all dsimplices of \(\mathcal{K}\) have X in their vertex set.
Proof
Obviously S′=n−d−1>4. As p _{ X } is assumed to be an interior point of S′, apply Lemma 8 to S′, and obtain a 3dimensional simplicial complex \(\mathcal{K}'\) with vertex set S′ of size at least 2(n−d−1)−6=2n−2d−8, such that all the 3simplices of \(\mathcal{K}'\) have p _{ X } as a vertex.
To get \(\mathcal{K}\) from \(\mathcal{K}'\), lift each 3simplex of \(\mathcal{K}'\) to the convex hull of the preimage of its vertex set. Thus \(\mathcal{K}\) is a ddimensional simplicial complex with vertex set S and size at least 2n−2d−8. As all 3simplices of \(\mathcal{K}'\) have p _{ X } as a vertex, each dsimplex of \(\mathcal{K}\) has X as a vertex subset. □
In the light of the previous lemma it is of interest to know the conditions for a subset X of S in \(\mathbb{R}^{d}\) (d>3) to project to an interior point of S′. We make the following statement.
Lemma 13
Let S be a set of n>d points in general position in \(\mathbb{R}^{d}\) (d>3) and let X⊂S be a subset of d−2 points. With Π denote the (d−3)dimensional hyperplane spanned by X and with Π′ a 3dimensional hyperplane orthogonal to Π. Project S orthogonally to Π′ and denote with S′ the resulting image of S and with p _{ X } the image of X, respectively. Then p _{ X } is an extremal point of S′ if and only if \(\operatorname {Conv}(X)\) is a (d−3)dimensional facet of \(\operatorname{CH}(S)\).
Proof
If \(\operatorname{Conv}(X)\) is a (d−3)dimensional facet of \(\operatorname{CH}(S)\), then there exists a (d−1)dimensional hyperplane Π _{ T } “tangential” to \(\operatorname{Conv}(S)\), containing only X and having all other points of S on one side. Thus, there exists a “tangential” plane \(\varPi_{T}'=\varPi_{T}\cap\varPi'\) at p _{ X }, such that all points of S′∖{p _{ X }} are on one side of \(\varPi_{T}'\). Hence, p _{ X } is extremal.
If \(\operatorname{Conv}(X)\) is not a (d−3)dimensional facet of \(\operatorname{CH}(S)\), then all (d−1)dimensional hyperplanes containing X have points of S on both sides, and therefore p _{ X } is not extremal in S′. Assume the contrary: at least one (d−1)dimensional hyperplane, Π _{ T }, containing X exists, such that all points of S∖X are on one side of Π _{ T }. Then we could tilt Π _{ T } keeping all of its contained points and consuming the ones it hits while tilting, until Π _{ T } contains d points; i.e., until Π _{ T } consumed two more points, q _{1} and q _{2}. Still all points of S, except the ones contained in Π _{ T }, are on one side of Π _{ T }. Observe that a hyperplane spanned by d points (in a point set in general position) is a (d−1)dimensional hyperplane. Hence, Π _{ T } has become a supporting hyperplane of a (d−1)dimensional facet, \(\operatorname{Conv}(X\cup\{ q_{1},q_{2}\})\), of \(\operatorname{CH}(S)\). As the convex hull of every subset of (X∪{q _{1},q _{2}}) is a facet of \(\operatorname{CH}(S)\), this is a contradiction to the assumption that \(\operatorname{Conv}(X)\) is not a (d−3)dimensional facet of \(\operatorname{CH}(S)\). □
Higher Dimensional Versions of the Order and Discrepancy Lemmas
We prove the higher dimensional versions of the Order and Discrepancy Lemmas from [1]. The proofs are essentially the same as in the planar case, with the difference that some facts we used in the plane are now provided by the lemmas in the previous sections.
Recall that in a partial order a chain is a set of pairwise comparable elements, whereas an antichain is a set of pairwise incomparable elements.
Order Lemma
Lemma 14
Let S be a set of η+d+1 points (η≥0) in general position in \(\mathbb{R}^{d}\) (d≥2), such that \(\operatorname {Conv}(S)\) is a dsimplex. Then there exists a triangulation of S, such that at least \((d1)\eta+ \eta^{(2^{(1d)})}+1\) of its dsimplices contain a convex hull point of S.
Proof
Let I be the set of the η interior points of S. Let \(\mathcal{F} = \{F_{1}, \dots, F_{d+1}\}\) be the set of the (d−1)dimensional faces of \(\operatorname{CH}(S)\). For each \(F_{i} \in\mathcal{F}\) we define a partial order \(\leq_{F_{i}}\) on I. We say that \(p \leq_{F_{i}} q\) (p,q∈I) if p is in the interior of the dsimplex \(\operatorname{Conv}(F_{i} \cup\{q\})\). Our goal is to obtain a “long” chain C ^{∗} with respect to some \(F^{*}\in\mathcal{F}\) such that \(C^{*} \geq\eta^{(2^{(1d)})}\).
By Dilworth’s Theorem [8] w.r.t. \(\leq_{F_{d+1}}\), there exists a chain or an antichain C _{ d+1} in I of size at least \(\sqrt{\eta}\geq\eta^{(2^{(1d)})}\). If C _{ d+1} is a chain then we obtain C ^{∗}=C _{ d+1}, \(C^{*}\geq\eta^{(2^{(1d)})}\), and F ^{∗}=F _{ d+1}. Otherwise, we iteratively apply Dilworth’s Theorem w.r.t. \(\leq_{F_{i}}\) to the points of the antichain C _{ i+1}, i from d down to 3, to obtain a chain or antichain C _{ i } of size at least \(\sqrt{C_{i+1}} = \eta^{(2^{(id2)})}\). As soon as C _{ i } is a chain, terminate with C ^{∗}=C _{ i }, F ^{∗}=F _{ i }, and \(C^{*} \geq\eta^{(2^{(1d)})}\). Otherwise, the process ends with the antichain C _{3} of size at least \(\eta^{(2^{(1d)})}\). Observe that an antichain with respect to all but two faces is a chain with respect to the remaining two faces. Hence, C ^{∗}=C _{3}, F ^{∗}=F _{2}, with \(C^{*}\geq\eta^{(2^{(1d)})}\).
Let \(p_{1}\leq_{F^{*}}\cdots\leq_{F^{*}} p_{r}\) (r=C ^{∗}) be the points of C ^{∗}. Construct a triangulation \(\mathcal{T}\) of S, starting with \(\mathcal{T}\) consisting only of the dsimplex \(\operatorname {Conv}(S)\). Then insert the points of C ^{∗} into \(\mathcal{T}\) in the order p _{ r },…,p _{1}. With each step one dsimplex is replaced by (d+1) new ones. This results in an intermediate triangulation \(\mathcal{T}\) of \(((S\cap\operatorname{CH}(S))\cup\{p_{1}\ldots p_{r}\} )\) consisting of (dr+1) many dsimplices, each of which having at least one point in \(\operatorname{CH}(S)\) as a vertex.
Let σ _{ i }, 1≤i≤dr+1, be the dsimplices of \(\mathcal{T}\), let η _{ i } be the number of interior points of σ _{ i }, and let p _{ i } be a vertex of σ _{ i } that is also in \(\operatorname{CH}(S)\). By Lemma 6 there exists a triangulation of S∩σ _{ i } such that (d−1)(η _{ i }+d+1)−d ^{2}+2=(d−1)η _{ i }+1 of its dsimplices have p _{ i } as a vertex. Therefore, the remaining points can be inserted into \(\mathcal{T}\), such that at least
of the dsimplices of \(\mathcal{T}\) have at least one point in \(\operatorname{CH}(S)\). Since \(r\geq \eta^{(2^{(1d)})}\), at least \((d1)\eta+ \eta^{(2^{(1d)})} + 1\) many dsimplices have at least one point in \(\operatorname{CH}(S)\). □
We are now able to prove the highdimensional variation of the “Order Lemma”:
Lemma 15
(Generalized Order Lemma)
Let S be a set of n≥d+1 points in general position in \(\mathbb{R}^{d}\) (d>2) with \(h=S\cap\operatorname{CH}(S)\). Then there exists a triangulation of S, such that at least \((d1)n+(nh)^{(2^{(1d)})}+2hc_{d}\) of its dsimplices have at least one point in \(\operatorname{CH}(S)\), with c _{ d } as defined in Lemma 3.
Proof
Let \(S'=S\cap\operatorname{CH}(S)\) be the set of convex hull points of S. If h>d(d+1), then by Lemma 3 there exists a triangulation of S′ of size τ≥(d+1)h−c _{ d }. If h≤d(d+1), then by Theorem 2 any triangulation of S′ has size at least τ≥h−d=(d+1)h−dh−d≥(d+1)h−c _{ d }.
Let σ _{ i }, 1≤i≤τ, be the dsimplices of the triangulation of S′, and let η _{ i } be the number of interior points of σ _{ i }. By Lemma 14 there exists a triangulation \(\mathcal{T}_{i}\) of S∩σ _{ i }, such that at least \((d1)\eta_{i} + \eta_{i}^{(2^{(1d)})} + 1\) of the dsimplices of \(\mathcal{T}_{i}\) have at least one point in \(\operatorname{CH}(S\cap\sigma_{i})\). In total we obtain a triangulation \(\mathcal{T}\) of S, such that at least
of the dsimplices of \(\mathcal{T}\) have at least one point in \(\operatorname{CH}(S)\). □
Discrepancy Lemma
Let S be a kcolored set of n points in general position in \(\mathbb{R}^{d}\) and let S _{1},S _{2},…,S _{ k } be its color classes. Recall that we consider k and d to be constants w.r.t. n, i.e., k and d are independent of n. We define the discrepancy δ(S) of S to be the sum of differences between the sizes of its biggest chromatic class and the remaining classes. Let S _{max} be the chromatic class with the maximum number of elements. Then δ(S)=∑(S _{max}−S _{ i })=(k−1)S _{max}−S∖S _{max}=kS _{max}−n. Further, we denote with S _{min} the chromatic class with the least number of elements.
We start with two statements describing the interaction of δ(S), S _{max}, and S _{min}.
Lemma 16
Let S be a kcolored set of n points in \(\mathbb{R}^{d}\). Let f _{(n,d,k)} be some function on k, d, and n. If \(S_{\min} \leq\frac{n}{k}(k1)\cdot f_{(n,d,k)}\) then \(S_{\max} \geq\frac{n}{k} + f_{(n,d,k)}\), and δ(S)≥k⋅f _{(n,d,k)}.
Proof
From \(S_{\min} \leq\frac{n}{k}(k1)\cdot f_{(n,d,k)}\) we get
As there exist (k−1) color classes besides S _{min}, all not bigger than S _{max}, we have \(S_{\max} \geq\frac{n}{k} + f_{(n,d,k)}\). This leads to
□
The following corollary is a direct consequence of Lemma 16.
Corollary 17
Let S be a kcolored set of n points in \(\mathbb{R}^{d}\). Let f _{(n,d,k)} be some function on k, d, and n. If δ(S)<k⋅f _{(n,d,k)} then \(S_{\min} > \frac{n}{k}(k1)\cdot f_{(n,d,k)}\).
The previous two technical statements will be needed for the Theorems 27 and 28. For the sake of completeness we state the “original” Discrepancy Lemma for d=k=2 from [1].
Lemma 18
(Discrepancy Lemma [1])
Let S be a 2colored set of n≥3 points in general position in \(\mathbb{R}^{2}\), such that δ(S)≥2. Then S determines at least \(\frac{\delta(S)2}{6}(n+\delta(S))\) empty monochromatic triangles.
In the following we proof the highdimensional variation of this “Discrepancy Lemma”:
Lemma 19
(Generalized Discrepancy Lemma)
Let S be a kcolored set of \(n>k\cdot4^{d^{2}(d+1)}\) points in general position in \(\mathbb{R}^{d}\), with d≥k>3. Then S determines Ω(n ^{d−k+1}⋅(δ(S)+logn)) empty monochromatic dsimplices.
Proof
Consider a subset X of d−k+1 points of S _{max}. From the requirements of the lemma we have d>3, \(S_{\max}\geq \lceil\frac{n}{k} \rceil> 4^{d^{2}(d+1)}\), and 1≤X≤d−3. Thus we may apply Lemma 10 to X which guarantees the existence of a dsimplicial complex \(\mathcal{K}_{X}\) with vertex set S _{max}, such that \(\mathcal{K}_{X}\) has size strictly larger
and all dsimplices of \(\mathcal{K}_{X}\) have X in their vertex set. Since every point of S∖S _{max} is in at most one dsimplex of \(\mathcal{K}_{X}\), \(\mathcal{K}_{X}\) contains at least \(\delta(S)+\frac{\log_{2}{S_{\max}}}{2(k1)}2c_{d1}\) empty monochromatic dsimplices.
We do this counting for each of the \(\binom{S_{\max}}{dk+1}\) subsets of (d−k+1) points of S _{max}, and overcount each empty monochromatic dsimplex at most \(\binom{d+1}{dk+1}\) times. Hence, in total we get \(\frac{\binom{S_{\max}}{dk+1}}{\binom{d+1}{dk+1}} \cdot ( \delta(S)+\frac{\log_{2}{S_{\max}}}{2(k1)}2c_{d1} )\) empty monochromatic dsimplices. As \(S_{\max}\geq \lceil\frac{n}{k} \rceil\), and d, c _{ d−1} (see Lemma 3), and k are constant w.r.t. n, we get Ω(n ^{d−k+1}⋅(δ(S)+logn)) empty monochromatic dsimplices in S. □
Observe, that this “Generalized Discrepancy Lemma” is not applicable for small values of k and d. With the 2colored variant in \(\mathbb{R}^{2}\) already provided in Lemma 18 ([1]), we generalize it to \(\mathbb{R}^{d}\) in the next lemma.
Lemma 20
Let S be a 2colored set of n>2d points in general position in \(\mathbb{R}^{d}\), with d≥3. Then S determines Ω(n ^{d−1}⋅δ(S)) empty monochromatic dsimplices.
Proof
Consider a subset X of d−1 points of S _{max}. From the requirements of the lemma we have d≥3, \(S_{\max}\geq \lceil\frac{n}{2} \rceil> d\), and X=d−1. Thus we may apply Lemma 11 to X which guarantees the existence of a dsimplicial complex \(\mathcal{K}_{X}\) with vertex set S _{max}, such that \(\mathcal{K}_{X}\) has size at least S _{max}−d and all dsimplices of \(\mathcal{K}_{X}\) have X in their vertex set. Since every point of S∖S _{max} is in at most one dsimplex of \(\mathcal{K}_{X}\), \(\mathcal{K}_{X}\) contains at least δ(S)−d empty monochromatic dsimplices.
We do this counting for each of the \(\binom{S_{\max}}{d1}\) subsets of (d−1) points of S _{max}, and overcount each empty monochromatic dsimplex at most \(\binom{d+1}{d1}=\binom{d+1}{2}\) times. Hence, in total we get \(\frac{\binom{S_{\max}}{d1}}{\binom{d+1}{2}} \cdot(\delta(S)d)\) empty monochromatic dsimplices. As \(S_{\max}\geq \lceil\frac{n}{2} \rceil\), and d is constant w.r.t. n, we get Ω(n ^{d−1}⋅δ(S)) empty monochromatic dsimplices in S. □
The still missing 3colored case of the “Discrepancy Lemma” turns out to be quite difficult. In the remaining three lemmas of this section we will first prove the variant for \(\mathbb{R}^{3}\), then give a general bound for \(\mathbb{R}^{d}\) and d>4, and lastly providing the missing case of \(\mathbb{R}^{4}\).
Lemma 21
Let S be a 3colored set of n≥12 points in general position in \(\mathbb{R}^{3}\). Then S determines at least \(\frac{\delta(S)10}{12}\cdot n +3\) empty monochromatic 3simplices.
Proof
Let p be a point of S _{max}. From the requirements of the lemma we have d=3 and \(S_{\max}\geq \lceil\frac{n}{3} \rceil\geq4\). Thus we may apply Lemma 8 to p which guarantees the existence of a 3simplicial complex \(\mathcal{K}_{p}\) with vertex set S _{max}, such that all 3simplices of \(\mathcal{K}_{p}\) have p as a vertex, and \(\mathcal{K}_{p}\) has size at least

2S _{max}−6 if p is an interior point of S _{max} and

2S _{max}−ϱ(p)−4 if p is a convex hull point of S _{max} and ϱ(p) is the degree of p in the 1skeleton of \(\operatorname{CH}{(S_{\max})}\).
Since every point of S∖S _{max} is in at most one 3simplex of \(\mathcal{K}_{p}\), \(\mathcal{K}_{p}\) contains at least δ(S)−6 empty monochromatic dsimplices if p is an interior point of S _{max}, and δ(S)−ϱ(p)−4 empty monochromatic dsimplices if p is a convex hull point of S _{max}.
We do this counting for each point in S _{max}, and overcount each empty monochromatic 3simplex at most 4 times. Denote with h the number of convex hull points of S _{max}. We know from Theorem 1 that summing over all convex hull points of S _{max} we have ∑ϱ(p)=2⋅(3h−6)=6h−12. Hence, in total we get
empty monochromatic 3simplices. As \(S_{\max}\geq \lceil\frac{n}{3} \rceil\), we get at least \(\frac{\delta(S)10}{12}\cdot n + 3\) empty monochromatic 3simplices in S. □
Lemma 22
Let S be a 3colored set of n>3d+15 points in general position in \(\mathbb{R}^{d}\) (d>4). Then S determines Ω(n ^{d−2}⋅δ(S)) empty monochromatic dsimplices.
Proof
Consider a subset X of d−2 points of S _{max}. Note that \(S_{\max}\geq \lceil\frac{n}{3} \rceil\). Denote with Π the (d−3)dimensional hyperplane containing X and with Π′ a 3dimensional hyperplane orthogonal to Π. Project S _{max} orthogonally to Π′, and let \(S_{\max}'\) be the resulting image. The set X is projected to a single point p _{ X } in Π′.
By Lemma 13, p _{ X } is an extremal point of \(S_{\max}'\) only if \(\operatorname{Conv}(X)\) is a (d−3)dimensional facet of \(\operatorname{CH}(S_{\max})\). By the upper bound theorem [14], the convex hull of a point set in \(\mathbb{R}^{d}\) has size at most \(\varTheta(n^{\lfloor\frac{d}{2}\rfloor})\). Obviously, this bound applies to the number of all ξdimensional facets, 1≤ξ<d, of \(\operatorname{CH}(S_{\max})\), as d is constant, i.e., independent of S _{max}.
On the other hand, the total number of different subsets of d−2 points of S _{max} is \(\binom{S_{\max}}{d2} \geq\binom{\frac{n}{3}}{d2} = \varTheta(n^{d2})\). As \(d2 > \lfloor\frac{d}{2}\rfloor\) for d>4, there exist
different subsets X, such that p _{ X } is an interior point of \(S_{\max}'\).
For each such subset X apply Lemma 12, as \(S_{\max}\geq \lceil\frac{n}{3} \rceil> d+5\) and d>3. This guarantees for each X the existence of a dsimplicial complex \(\mathcal{K}_{X}\) with vertex set S _{max}, such that \(\mathcal{K}_{X}\) has size at least 2S _{max}−2d−8 and all dsimplices of \(\mathcal{K}_{X}\) have X in their vertex set. Since every point of S∖S _{max} is in at most one dsimplex of \(\mathcal{K}_{X}\), \(\mathcal{K}_{X}\) contains at least δ(S)−2d−8 empty monochromatic dsimplices.
As we can do this counting for Θ(n ^{d−2}) different subsets, and overcount each empty monochromatic dsimplex at most \(\binom{d+1}{d2}\) times, we get at least
empty monochromatic dsimplices in total. □
For \(\mathbb{R}^{4}\) the simple asymptotic counting from the previous proof does not work. We have to take a more detailed look.
Lemma 23
Let S be a 3colored set of n>27 points in general position in \(\mathbb{R}^{4}\). Then S determines Ω(n ^{2}⋅δ(S)) empty monochromatic 4simplices.
Proof
Note that \(S_{\max}\geq \lceil\frac{n}{3} \rceil\). Recall that the size of \(\operatorname{CH}(S_{\max})\) is bounded by \(O(S_{\max}^{\lfloor\frac{4}{2}\rfloor}) = O(S_{\max}^{2})\). Thus, there are also at most quadratically many edges on \(\operatorname{CH}(S_{\max})\). We distinguish two cases depending on the number of edges on \(\operatorname{CH}(S_{\max})\).

(1)
If less than quadratically many edges are on \(\operatorname{CH}(S_{\max})\), then there exist Θ(S _{max}^{2}) many pairs of points of S _{max} that are no 1dimensional facet of \(\operatorname{CH}(S_{\max})\). Consider a subset X of 2 points of S _{max}, forming such a pair. Denote with Π the line containing X and with Π′ a 3dimensional hyperplane orthogonal to Π. Project S _{max} orthogonally to Π′, and let \(S_{\max}'\) be the resulting image. The set X is projected to a single point p _{ X } in Π′. By Lemma 13, p _{ X } is an interior point of \(S_{\max}'\), as \(\operatorname{Conv}(X)\) is not an edge of \(\operatorname{CH}(S_{\max})\). Apply Lemma 12 to X, as \(S_{\max}\geq \lceil\frac{n}{3} \rceil> d+5\) and d=4>3. This guarantees for X the existence of a 4simplicial complex \(\mathcal{K}_{X}\) with vertex set S _{max}, such that \(\mathcal{K}_{X}\) has size at least 2S _{max}−16 and all 4simplices of \(\mathcal{K}_{X}\) have X in their vertex set. Since every point of S∖S _{max} is in at most one 4simplex of \(\mathcal{K}_{X}\), \(\mathcal{K}_{X}\) contains at least δ(S)−16 empty monochromatic 4simplices. As we can do this counting for Θ(S _{max}^{2})=Θ(n ^{2}) different subsets, and overcount each empty monochromatic 4simplex at most \(\binom{5}{2}\) times, we get at least Θ(n ^{2})⋅(δ(S)−16) empty monochromatic 4simplices in total.

(2)
If there are Θ(S _{max}^{2}) many edges on \(\operatorname{CH}(S_{\max})\), then there are also Θ(S _{max}^{2}) many tetrahedra on \(\operatorname{CH}(S_{\max})\) (because the number of tetrahedra is at least a sixth of the number of edges), and obviously \(S_{\max}\cap\operatorname{CH}(S_{\max}) = \varTheta(S_{\max})\). For a point p∈S _{max} make a pulling triangulation \(\mathcal{K}_{p}\) of \((S_{\max}\cap\operatorname{CH}(S_{\max}))\cup\{p\}\). Inserting the remaining points of S _{max} into \(\mathcal{K}_{p}\) does not decrease the number of 4simplices in \(\mathcal{K}_{p}\), which have p as a vertex. Remove all 4simplices from \(\mathcal{K}_{p}\) that don’t have p as a vertex. Then \(\mathcal{K}_{p}\) is a 4dimensional simplicial complex, such that every 4simplex has p as a vertex and \(\mathcal{K}_{p}\) is of size

(a)
Θ(S _{max}^{2}), if p is an interior point of S _{max}, or

(b)
Θ(S _{max}^{2})−ϱ(p), if p is an extremal point of S _{max}, where ϱ(p) is the number of tetrahedra in \(\operatorname{CH}(S_{\max})\), having p as a vertex.
For case (b) observe, that \(\sum_{p\in(S_{\max}\cap\operatorname{CH}(S_{\max}))}{\varrho (p)} = 4\cdot\varTheta(S_{\max}^{2})\). Thus on average, at least Ω(S _{max}) points of S _{max} have at most O(S _{max}) incident tetrahedra in \(\operatorname{CH}(S_{\max})\). Hence, Θ(S _{max}^{2})−ϱ(p)=Θ(S _{max}^{2}) for Θ(S _{max}) points in S _{max}, which we can all choose for the point p.
All 4simplices of \(\mathcal{K}_{p}\) are empty of points of S _{max} by construction. Since every point of S∖S _{max} is in at most one 4simplex of \(\mathcal{K}_{p}\), \(\mathcal{K}_{p}\) contains at least Θ(S _{max}^{2})−2S _{max}+δ(S)−2d−8=Θ(n ^{2}) empty monochromatic 4simplices. Note that δ(S)=O(n). As we can do this counting for Θ(S _{max})=Θ(n) different points, and overcount each empty monochromatic 4simplex at most 5 times, we get Ω(n ^{3})≥Ω(n ^{2}⋅δ(S)) empty monochromatic 4simplices in total. □

(a)
With this last lemma in a line of five lemmas in total and including [1], we now have a “Discrepancy Lemma” type of statement for all kcolored point sets in \(\mathbb{R}^{d}\), for every combination of d≥2 and 2≤k≤d.
Empty Monochromatic Simplices in kColored Point Sets
In this section we present our results on the minimum number of empty monochromatic dsimplices determined by any kcolored set of n points in general position in \(\mathbb{R}^{d}\). Some first bounds follow directly from the results in the previous section.
Theorem 24
Every (d+1)colored set S of \(n \geq (d+1)\cdot4^{d(c_{d}+1)}\) points in general position in \(\mathbb{R}^{d}\) (d>2), c _{ d } defined as in Lemma 3, determines an empty monochromatic dsimplex.
Proof
Let S _{max} be the largest chromatic class of S. From the requirements of the theorem we have d>2 and \(S_{\max}\geq \lceil\frac{n}{d+1} \rceil\geq4^{d(c_{d}+1)} = 4^{d^{4}+d^{3}+d^{2}+d} > 4^{d^{2}(d+1)}\). By Theorem 5, S _{max} has a triangulation \(\mathcal{T}\) of size at least \(dS_{\max}+\frac{\log_{2}{S_{\max}}}{2d}c_{d}\). All the dsimplices of \(\mathcal{T}\) are of the same color and empty of points of S _{max}. There are at most dS _{max} points in S of the remaining colors, and each of these points is in at most one dsimplex of \(\mathcal{T}\).
Therefore, at least \(\frac{\log_{2}{S_{\max}}}{2d}c_{d} \geq \frac{2d(c_{d}+1)}{2d}c_{d}=1\) of the dsimplices of \(\mathcal{T}\) are empty of points of S. □
Note that d>2 is crucial here, as for d=2 Devillers et al. [7] showed that there are arbitrarily large 3colored sets which do not contain an empty monochromatic triangle.
As an immediate corollary of Theorem 24 we have:
Corollary 25
Every (d+1)colored set S of \(n \geq (d+1)\cdot4^{d(c_{d}+1)}\) points in general position in \(\mathbb{R}^{d}\) (d>2), c _{ d } defined as in Lemma 3, determines at least a linear number of empty monochromatic dsimplices.
Proof
By Theorem 24 there exists a constant \(\mu_{d}\leq (d+1)\cdot4^{d(c_{d}+1)}\) such that every subset of S of μ _{ d } points determines at least one empty monochromatic dsimplex. Divide S (with parallel (d−1)dimensional hyperplanes) into \(\lfloor\frac{n}{\mu_{d}} \rfloor\) subsets of μ _{ d } points each. Hence, in total there exist at least \(\lfloor\frac{n}{\mu_{d}} \rfloor\) empty monochromatic dsimplices in S. □
The next result follows immediately from Lemma 19 and provides a first general lower bound.
Corollary 26
Let S be a kcolored set of \(n>k\cdot4^{d^{2}(d+1)}\) points in general position in \(\mathbb{R}^{d}\), with d≥k>3. Then S determines Ω(n ^{d−k+1}logn) empty monochromatic dsimplices.
Proof
This is a direct consequence of Lemma 19 since every colored set has discrepancy at least 0. □
We will further improve on this result in Theorem 29 below. The next theorem is central for this improvement and provides a relation between the number of empty monochromatic dsimplices of an arbitrary color in a dcolored point set \(S\subset\mathbb{R}^{d}\), and convex subsets of S with high discrepancy.
Theorem 27
Let S be a dcolored set of \(n\geq3d\cdot(2c_{d})^{(2^{d1})}\) points in general position in \(\mathbb{R}^{d}\), d>2 and c _{ d } as defined in Lemma 3. For every 1≤j≤d, either there are \(\varOmega(n^{1+2^{d}})\) empty monochromatic dsimplices of color j, or there is a convex set C in \(\mathbb{R}^{d}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(n^{(2^{d})})\).
Proof
The general idea for the proof is to iteratively peel convex layers of color j from the point set. For each layer we use the Generalized Order Lemma to obtain roughly \(n^{(2^{1d})}\) empty monochromatic dsimplices of color j. If at any moment the discrepancy is large enough we terminate the process with the desired convex set C. Otherwise, the iteration stops after at most \(\frac{1}{8}n^{(12^{d})}\) steps.
Let S _{ i } be the dcolored set of points in iteration step i. With S _{ i,l } we denote the chromatic classes of S _{ i }, and with S _{ i,max}/S _{ i,min} we denote the largest/smallest chromatic class of S _{ i }, respectively. Note that a point of S _{ i } can only be in one chromatic class, and that \(\bigcup_{l=1}^{d} S_{i,l} = S_{i}\). The iteration starts with S _{1}=S. For i>1 smaller sets are constructed, such that S _{ i+1}⊂S _{ i } and S _{ i+1,l }⊆S _{ i,l }. Let \(\tilde{n}=\frac{n}{3d}\). As an invariant through all iterations we guarantee
The iteration stops either if a convex set C is found, with S∩C=Θ(n) and \(\delta(S\cap C) \geq \frac{\tilde{n}^{(2^{d})}}{(d1)}\), or after at most \(\frac{1}{8}n^{(12^{d})}\) steps.
Consider the ith step of the iteration. We will prove inequalities on the sizes of different subsets, their discrepancy, and the size of chromatic classes. With R _{ i } we denote the jth chromatic class in step i, i.e., S _{ i,j } of S _{ i }. Further, let h _{ i } be the number of points in \(R_{i}\cap\operatorname{CH}{(R_{i})}\) and let \(X_{i}=S_{i}\cap \operatorname{Conv}{(R_{i})}\), such that the chromatic classes of X _{ i } are \(X_{i,l}=S_{i,l}\cap\operatorname {Conv}{(R_{i})}\), with X _{ i,max} and X _{ i,min} being the largest and smallest chromatic class of X _{ i }, respectively. See also Fig. 5 for an illustration of the different sets. The next iteration step i+1 will consist of \(S_{i+1}= X_{i} \setminus (R_{i}\cap\operatorname{CH}{(R_{i})})\) and S _{ i+1,l }=S _{ i,l }∩S _{ i+1}.

(1)
\(\delta(S_{i}) < \frac{\tilde{n}^{(2^{d})}}{d1}\).
If \(\delta(S_{i}) \geq\frac{\tilde{n}^{(2^{d})}}{d1}\), then the iteration terminates with \(C = \operatorname{Conv}(S_{i})\), as S∩C=S _{ i } and S _{ i }=Θ(n) by the invariant.

(2)
\(R_{i} > \frac{S_{i}}{d}\frac{\tilde{n}^{(2^{d})}}{d} > \tilde{n}\).
By inequality (1), \(\delta(S_{i}) < \frac{\tilde{n}^{(2^{d})}}{d1}= d\cdot\frac{\tilde{n}^{(2^{d})}}{d(d1)}\). Applying Corollary 17 we get \(S_{i,\min} > \frac{S_{i}}{d} (d1)\cdot\frac{\tilde{n}^{(2^{d})}}{d(d1)} = \frac{S_{i}}{d}\frac{\tilde{n}^{(2^{d})}}{d} \geq \frac{(d+1)\tilde{n}\tilde{n}^{(2^{d})}}{d} > \tilde{n}\). Obviously R _{ i }≥S _{ i,min}, which proves the inequality.

(3)
\(\delta(X_{i}) < \frac{\tilde{n}^{(2^{d})}}{d1}\).
Obviously, X _{ i }≥R _{ i }. Thus, by inequality (2), \(X_{i} >\tilde{n} = \varTheta(n)\). Hence, if \(\delta(X_{i}) \geq \frac{\tilde{n}^{(2^{d})}}{d1}\), then the iteration terminates with \(C = \operatorname{Conv}(X_{i})\).

(4)
\((d1)R_{i}X_{i}\setminus R_{i} > \tilde{n}^{(2^{d})}\).
Assume the contrary: \((d1)R_{i}X_{i}\setminus R_{i} \leq \tilde{n}^{(2^{d})}\), which can be rewritten to \(dR_{i}\leq X_{i}  \tilde{n}^{(2^{d})}\). From inequality (3) we know that \(\delta(X_{i}) < \frac{\tilde{n}^{(2^{d})}}{d1}\), which implies by Corollary 17 that \(X_{i,\min} > \frac{X_{i}}{d}\frac{\tilde{n}^{(2^{d})}}{d}\). As obviously R _{ i }≥X _{ i,min}, we get \(X_{i}  \tilde{n}^{(2^{d})} \geq dR_{i} > X_{i}  \tilde{n}^{(2^{d})}\), which is a contradiction.

(5)
\(S_{i}\setminus X_{i} < 2\tilde{n}^{(2^{d})}\).
Assume the contrary: \(S_{i}\setminus X_{i} \geq 2\tilde{n}^{(2^{d})}\). Using inequality (3) and the definition for the discrepancy we get
$$\frac{\tilde{n}^{(2^{d})}}{d1}>\delta(X_i) = (d1)X_{i,\max}  X_i\setminus X_{i,\max} \geq(d1)R_iX_i \setminus R_i. $$Further, we know that X _{ i }∖R _{ i }=S _{ i }∖R _{ i }−S _{ i }∖X _{ i } and from inequality (2) we know \(R_{i} > \frac{S_{i}}{d}\frac{\tilde{n}^{(2^{d})}}{d}\). Together with the assumption this leads to
$$\begin{aligned}[c] \frac{\tilde{n}^{(2^{d})}}{d1} & > (d1)R_iS_i\setminus R_i + S_i\setminus X_i \\ & = dR_iS_i + S_i\setminus X_i > S_i\tilde{n}^{(2^{d})}S_i+2 \tilde{n}^{(2^{d})}=\tilde{n}^{(2^{d})}, \end{aligned} $$which is a contradiction.

(6)
\(\delta(S_{i+1}) < \frac{\tilde{n}^{(2^{d})}}{d1}\).
Note that \(\delta(S_{i+1}) = \delta(X_{i} \setminus (R_{i}\cap\operatorname{CH}{(R_{i})}))\) by the definition of the next iteration step. Although inequality (6) looks very similar to inequality (1), we have to prove it here, because we may not assume the invariant for the next step, yet.
Using inequality (5) we can give the following bound:
$$X_i=S_iS_i\setminus X_i> S_i2\tilde{n}^{(2^{d})}. $$From inequality (3) we get \((d1)X_{i,\max}X_{i}\setminus X_{i,\max} = \delta(X_{i}) < \frac{\tilde{n}^{(2^{d})}}{d1}\) and therefore \(R_{i}\leqX_{i,\max}<\frac{X_{i}+\frac{\tilde{n}^{(2^{d})}}{d1}}{d}\). Combining these inequalities and using the invariant for S _{ i }, we get
$$\begin{aligned}[c] S_{i+1} & \geqX_iR_i > X_i\frac{X_i+\frac{\tilde{n}^{(2^{d})}}{d1}}{d} > \frac{d1}{d} \bigl(S_i2\tilde{n}^{(2^{d})} \bigr)  \frac{\tilde{n}^{(2^{d})}}{d(d1)} \\ & \geq \frac{(d1)(d+1)}{d}\tilde{n}  \frac{2(d1)^2+1}{d(d1)}\tilde{n}^{(2^{d})}. \end{aligned} $$As d>2 we may evaluate this relation to \(S_{i+1} > \frac{8}{3}\tilde{n}  \frac{3}{2}\tilde{n}^{(2^{d})} > \tilde{n} = \varTheta(n)\). Hence, if \(\delta(S_{i+1}) \geq\frac{\tilde{n}^{(2^{d})}}{d1}\), then the iteration terminates with \(C = \operatorname{Conv}(S_{i+1})\).

(7)
\(h_{i} < 2\tilde{n}^{(2^{d})}\).
As always, assume the contrary: \(h_{i} \geq 2\tilde{n}^{(2^{d})}\). We distinguish two cases on whether R _{ i } is the largest chromatic class of X _{ i } or not.

(a)
If R _{ i }≠X _{ i,max} then S _{ i+1,max}=X _{ i,max} and
$$S_{i+1}\setminus S_{i+1,\max} = X_{i}\setminus X_{i,\max}  h_i. $$Using inequality (6) and the definition for the discrepancy, we get
$$\begin{aligned}[c] \frac{\tilde{n}^{(2^{d})}}{d1}>\delta(S_{i+1}) & = (d1)S_{i+1,\max}  S_{i+1}\setminus S_{i+1,\max} \\ & = (d1)X_{i,\max}  X_{i}\setminus X_{i,\max} + h_i = \delta(X_i) + h_i, \end{aligned} $$which is a contradiction to the assumption, as δ(X _{ i })≥0.

(b)
If R _{ i }=X _{ i,max}, recall that R _{ i+1} denotes the jth color class of S _{ i+1} and observe that \(R_{i+1} = R_{i} \setminus(R_{i}\cap\operatorname{CH}{(R_{i})})\). From inequality (3) and R _{ i }=X _{ i,max} we derive \(\frac{\tilde{n}^{(2^{d})}}{d1} > \delta(X_{i}) = dR_{i}X_{i}= d(R_{i+1}+h_{i})  (S_{i+1}+h_{i})\), and get \(R_{i+1}< \frac{\tilde{n}^{(2^{d})}}{d(d1)} + \frac{S_{i+1}+h_{i}}{d}h_{i} = \frac{S_{i+1}}{d}(d1)\cdot (\frac{h_{i}}{d} \frac{\tilde{n}^{(2^{d})}}{d(d1)^{2}} )\). As S _{ i+1,min}≤R _{ i+1} we get from Lemma 16 that
$$\delta(S_{i+1}) \geq d\cdot \biggl(\frac{h_i}{d} \frac{\tilde{n}^{(2^{d})}}{d(d1)^2} \biggr) = h_i  \frac{\tilde{n}^{(2^{d})}}{(d1)^2}. $$Using inequality (6) and inserting the assumption for h _{ i }, results in the contradiction \(\frac{\tilde{n}^{(2^{d})}}{d1}>\delta(S_{i+1}) \geq \frac{\tilde{n}^{(2^{d})}}{d1}\cdot (2(d1)\frac {1}{d1} )\), as d>2.

(a)
Using these inequalities we can provide a lower bound on the number of empty monochromatic dsimplices of color j per step and hence, in total, and prove the invariant on S _{ i }. From inequality (2) we know that \(R_{i} > \tilde{n} = \frac{n}{3d} \geq d+1\). Thus we may apply the Generalized Order Lemma (Lemma 15) to R _{ i }, which guarantees at least \((d1)R_{i}+(R_{i}h_{i})^{(2^{1d})}+2h_{i}c_{d}\) interior disjoint dsimplices of color j with at least one point in \(\operatorname{CH}(R_{i})\) each. Only points of (X _{ i }∖R _{ i }) can be in these dsimplices, and each of these X _{ i }∖R _{ i } points lies inside at most one dsimplex. Therefore, there exist at least
empty monochromatic dsimplices of color j, each of them having at least one point in \(\operatorname{CH}(R_{i})\). Using the inequalities (4), (2), (7), and h _{ i }≥0, we get
where the last inequality holds for \(\tilde{n}\geq (2c_{d})^{(2^{d1})}\).
Recall that the next iteration step i+1 considers \(S_{i+1}= X_{i} \setminus (R_{i}\cap\operatorname{CH}{(R_{i})})\) and S _{ i+1,l }=S _{ i,l }∩S _{ i+1}, for 1≤l≤d. Note that all empty monochromatic dsimplices of color j from step i have at least one vertex in \(\operatorname {CH}{(R_{i})}\). As the points of \(\operatorname{CH}{(R_{i})}\) are not in S _{ i+1}, we do not overcount.
The iteration either terminates with a convex set C, such that S∩C=Θ(n) and \(\delta(S\cap C) \geq\frac{\tilde{n}^{(2^{d})}}{d1} = \varOmega(n^{(2^{d})})\), or it ends after \(\frac{1}{8}n^{(12^{d})}\) steps. With at least \(\frac{\tilde{n}^{(2^{1d})}}{10}\) empty monochromatic dsimplices of color j per step we get
such simplices in total.
It remains to prove the invariant \(S_{i+1}\geq(d+1)\tilde{n}\). After each step we have \(S_{i+1}= X_{i} \setminus(X_{i}\cap\operatorname {CH}{(R_{i})})\) and thus S _{ i+1}=S _{ i }−S _{ i }∖X _{ i }−h _{ i }. With inequalities (5) and (7) we get \(S_{i+1} > S_{i}  2\tilde{n}^{(2^{d})}2\tilde{n}^{(2^{d})} = S_{i}  4\tilde{n}^{(2^{d})}\). Therefore, starting with S _{1}=S, there are at least
points left after \(\frac{1}{8}n^{(12^{d})}\) steps, as d>2. □
We generalize the last result to kcolored point sets, for 3≤k≤d.
Theorem 28
Let S be a kcolored set of \(n\geq 2^{dk} (3k\cdot(2c_{d})^{(2^{k1})}+1 )\) points in general position in \(\mathbb{R}^{d}\), d>2 and c _{ d } defined as in Lemma 3. For every 3≤k≤d and every 1≤j≤k, either there are \(\varOmega(n^{dk+1+2^{d}})\) empty monochromatic dsimplices of color j, or there is a convex set C in \(\mathbb{R}^{d}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(n^{(2^{d})})\).
Proof
For fixed k we prove the theorem by induction on the dimension, and use Theorem 27 as an induction base for d=k>2. Consider the induction step (d−1)⟶d, for d>k. Denote with S _{ j } the jth, and with S _{min} the smallest chromatic class of S. If \(\delta(S)\geq \frac{n^{(2^{d})}}{k1}\) then \(C=\operatorname{Conv}(S)\) is the desired convex set, with S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(n^{(2^{d})})\). Thus assume that \(\delta(S) < \frac{n^{(2^{d})}}{k1} = k\cdot\frac{n^{(2^{d})}}{k(k1)}\). From Corollary 17 we know that \(S_{j}\geqS_{\min}>\frac{S}{k}(k1)\cdot\frac{n^{(2^{d})}}{k(k1)} = \frac{nn^{(2^{d})}}{k}\geq\frac{n}{2k} = \varTheta(n)\).
Let p∈S _{ j } be a point of color j. For every point q∈S∖{p} let r _{ q } be the infinite ray with origin p and passing through q. Let Π′ and Π″ be two (d−1)dimensional hyperplanes containing \(\operatorname{Conv}(S)\) between them and not parallel to any of the rays r _{ q }. See Fig. 6 for a sketch. Project from p every point in S∖{p} to Π′ or Π″, in the following way. Every ray r _{ q } intersects either Π′ or Π″ in a point q′ or q″, respectively. Take q′ or q″ to be the projection of q from p. Let S′ and S″ be the sets of these projected points in Π′ and Π″, respectively. The bigger set, assume w.l.o.g. S′ in Π′, is a set of at least \(\frac{n1}{2}\) points in general position in \(\mathbb{R}^{d1}\).
Apply the induction hypothesis to S′ and get either (a) \(\varOmega(n^{d1k+1+2^{d}})\) empty monochromatic (d−1)simplices of color j, or (b) a convex set C in \(\mathbb{R}^{d1}\), such that S′∩C=Θ(n) and \(\delta(S'\cap C) = \varOmega(n^{(2^{d+1})})\).
For case (b) observe, that the preimage of the point set of a convex set in Π′ is the point set of a convex set in \(\mathbb{R}^{d}\). Hence, C is a convex set in \(\mathbb{R}^{d}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(n^{(2^{d+1})})\), which trivially implies \(\delta(S\cap C) = \varOmega(n^{(2^{d})})\).
For case (a) note that, if X is the vertex set of an empty monochromatic (d−1)simplex of color j in Π′, then \(\operatorname{Conv}(X\cup{p})\) is an empty monochromatic dsimplex of color j in \(\mathbb{R}^{d}\). Repeat the projection and the induction for each point p∈S _{ j } and assume that this always results in case (a) (because the proof is completed if case (b) happens once). This results in a total of \(\frac{S_{j}}{d+1}\cdot\varOmega(n^{dk+2^{d}}) = \varOmega(n^{dk+1+2^{d}})\) empty monochromatic dsimplices of color j, as each dsimplex gets overcounted at most (d+1) times. □
Combining the last theorem with the “Generalized Discrepancy Lemma” (Lemma 19) and its different versions for the 3colored case (Lemmas 21 to 23), we can prove one of our main results.
Theorem 29
Any kcolored set S of n points in general position in \(\mathbb{R}^{d}\), d≥k≥3, determines \(\varOmega(n^{dk+1+2^{d}})\) empty monochromatic dsimplices.
Proof
By Theorem 28 either there exist \(\varOmega(n^{dk+1+2^{d}})\) empty monochromatic dsimplices, or there exists a convex set C in \(\mathbb{R}^{d}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(n^{(2^{d})})\). In the latter case, there exist \(\varOmega(n^{dk+1+2^{d}})\) empty monochromatic dsimplices by applying Lemma 19 (for d≥k>3), Lemma 21 (for d=k=3), Lemma 23 (for d=4 and k=3), or Lemma 22 (for d>4 and k=3) to the point set (S∩C). □
Empty Monochromatic Simplices in Two Colored Point Sets
For the sake of simplicity, we call the two color classes of a bichromatic point set S “red” and “blue”, and denote these point sets with R and B, respectively. Observe, that the discrepancy δ(S)=(k−1)S _{max}−S∖S _{max} simplifies to δ(S)=R−B for the bichromatic case k=2. This is the same notion of discrepancy as used in [1] and [15].
Note further, that assuming an upper bound for the discrepancy,
for a bicolored set of n points, leads to lower and upper bounds for the cardinality of both color classes in a simple way. The inequality reformulates to R−B<f _{ n } and R−B>−f _{ n }. Using R=S−B and B=S−R we make the following simple observation, which will be used frequently later on.
Observation 30
Let S be a bicolored set of n points in \(\mathbb{R}^{2}\), partitioned into a red point set R and a blue point set B. Let f _{ n } be some function on n. If δ(S)<f _{ n }, then B−f _{ n }<R<B+f _{ n } and R−f _{ n }<B<R+f _{ n }, and \(\frac{nf_{n}}{2}<R<\frac{n+f_{n}}{2}\) and \(\frac{nf_{n}}{2}<B<\frac{n+f_{n}}{2}\).
Using the Order and Discrepancy Lemmas from [1], Pach and Tóth [15] prove that the number of empty monochromatic triangles in bichromatic point sets in the plane is Ω(n ^{4/3}). We adapt this proof technique to our notation and explicitly state, in Theorem 31, an intermediate result showing the central trade off between many empty monochromatic triangles and large convex sets. This result will be generalized to higher dimensions in Theorem 32.
Theorem 31
Let S be a bicolored set of n points in general position in \(\mathbb{R}^{2}\), partitioned into a red point set R and a blue point set B. Then either there exist Ω(n ^{4/3}) empty red triangles, or there exists a convex set C in \(\mathbb{R}^{2}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = C\cap RC\cap B  = \varOmega(\sqrt[3]{n})\).
Proof
Following the lines of [15], we call a point p∈S rich if at least \(\frac{\sqrt[3]{n}}{3}\) empty monochromatic triangles in S have p as a vertex. The general idea for the proof is to iteratively remove a rich red point from the point set. We show that it is possible to find either \(\frac{n}{5}\) rich red points or a convex set C with the desired properties.
If there exists some convex set C in \(\mathbb{R}^{2}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(\sqrt[3]{n})\), then the theorem is proven. Hence, assume its nonexistence. Let S _{ i } be the bicolored set of points in iteration step i, and let R _{ i } and B _{ i } be its color classes. Further, let h _{ i } be the number of convex hull points of R _{ i } and let \(X_{i}=S_{i}\cap\operatorname{Conv}{(R_{i})}\). See also Fig. 5 for an illustration of the different sets. The iteration starts with S _{1}=S. For i>1 smaller sets S _{ i+1} are constructed, by removing one rich red point from S _{ i }. Considering the ith iteration \((1\leq i\leq\frac{n}{5})\), we can state the following relations:

(1)
\(S_{i}=S(i1)>n\frac{n}{5}+1=\varTheta(n)\).

(2)
\(\delta(S_{i})<\frac{\sqrt[3]{n}}{20}\).
By relation (1), S _{ i }=Θ(n). Thus, if \(\delta(S_{i})\geq\frac{\sqrt[3]{n}}{20}\), then we can set \(C=\operatorname{Conv}{(S_{i})}\), implying S∩C=Θ(n) and \(\delta(S\cap C)=\varOmega(\sqrt[3]{n})\), which we assumed not to exist.

(3)
\(R_{i}>\frac{2n}{5}\frac{\sqrt[3]{n}}{40}\) and \(B_{i}>\frac{2n}{5}\frac{\sqrt[3]{n}}{40}\).
Using inequality (1) and (2), and Observation 30 we get
$$R_i>\frac{S_i\frac{\sqrt[3]{n}}{20}}{2} > \frac{4n}{10}\frac{\sqrt[3]{n}}{40} \quad \mbox{and} \quad B_i>\frac{S_i\frac {\sqrt[3]{n}}{20}}{2} > \frac{4n}{10}\frac{\sqrt[3]{n}}{40}. $$ 
(4)
\(\delta(X_{i})<\frac{\sqrt[3]{n}}{20}\).
Obviously, X _{ i }≥R _{ i }=Θ(n), by inequality (3). Thus, \(\delta(X_{i})\geq\frac{\sqrt[3]{n}}{20}\) again supplies us with some \(C=\operatorname{Conv}{(S_{i})}\), which we assumed not to exist.

(5)
\(S_{i}\setminus X_{i}<\frac{\sqrt[3]{n}}{10}\).
Note that S _{ i }∖X _{ i }=B _{ i }∖X _{ i }. Using inequality (4) and Observation 30 we get \(B_{i}\cap\operatorname{Conv}(X_{i})=B_{i}S_{i}\setminus X_{i} = X_{i}\setminus R_{i} > R_{i}  \frac{\sqrt[3]{n}}{20}\). Using inequality (2) we get \(S_{i}\setminus X_{i} < B_{i}R_{i} + \frac{\sqrt[3]{n}}{20} \leq \delta(S_{i}) + \frac{\sqrt[3]{n}}{20} < 2\frac{\sqrt[3]{n}}{20}\).

(6)
\(h_{i}<\frac{\sqrt[3]{n}}{10}\).
Let \(X_{i}'=X_{i}\setminus(X_{i}\cap\operatorname{CH}(R_{i}))\). Obviously, \(X_{i}'\geqB_{i}S_{i}\setminus X_{i}\), and consequently \(X_{i}'>\frac{4n}{10}\frac{\sqrt[3]{n}}{40}\frac{\sqrt [3]{n}}{10}=\varTheta(n)\) by inequality (3) and (5). Therefore, we can assume \(\delta(X_{i}') = (R_{i}h_{i})X_{i}\setminus R_{i}  < \frac{\sqrt[3]{n}}{20}\), because the contrary would imply the existence of some \(C=\operatorname{Conv}{(X_{i}')}\), which we assumed not to exist. From \(X_{i}\setminus R_{i}(R_{i}h_{i}) < \frac{\sqrt[3]{n}}{20}\) and inequality (4) we get \(h_{i} < R_{i}  X_{i}\setminus R_{i} + \frac{\sqrt[3]{n}}{20} = \delta(X_{i})+\frac{\sqrt[3]{n}}{20} < \frac{\sqrt[3]{n}}{20}+\frac{\sqrt[3]{n}}{20}\).
Using these inequalities we can prove the existence of rich points. Let \(p_{1},\ldots,p_{h_{i}}\) be the convex hull points of R _{ i } in counter clockwise order. Triangulate \(\operatorname{CH}(R_{i})\) by adding the diagonals p _{1} p _{ j }, for 3≤j≤(h _{ i }−1). In the resulting triangulation let △_{ j }, 2≤j≤(h _{ i }−1), be the triangle p _{1} p _{ j } p _{ j+1}. With S(△_{ j }) denote the bicolored set of points interior to △_{ j } and let R(△_{ j }) and B(△_{ j }) be its color classes.

(7)
\(\delta(S(\triangle_{j})) = R(\triangle_{j})B(\triangle_{j})  < \frac{\sqrt[3]{n}}{10}\) for every 2≤j≤(h _{ i }−1).
Assume the contrary: \(\delta(S(\triangle_{j})) \geq \frac{\sqrt[3]{n}}{10}\) for some △_{ j }, 2≤j≤(h _{ i }−1). Consider the three regions (△_{2}∪⋯∪△_{ j−1}), △_{ j }, and \((\triangle_{j+1}\cup\cdots\cup\triangle_{h_{i}1})\). At least one of these three regions contains at least
$$\frac{X_ih_i}{3} = \frac{S_iS_i\setminus X_ih_i}{3} > \frac{1}{3} \biggl(n\frac{n}{5}+1\frac{\sqrt[3]{n}}{10}\frac {\sqrt[3]{n}}{10} \biggr) > \frac{n}{5} $$interior points, by inequality (1), (5), and (6).
If \(S(\triangle_{j}) \geq\frac{n}{5} = \varTheta(n)\), then we can set \(C=\operatorname{Conv}{(S(\triangle_{j}))}\), which we assumed not to exist. Thus assume w.l.o.g. that region (△_{2}∪⋯∪△_{ j−1}) has at least \(\frac{n}{5}\) interior points, i.e., \(S(\triangle_{2})\cup\cdots\cup S(\triangle_{j1}) \geq \frac{n}{5} = \varTheta(n)\). Note that also
$$\begin{aligned}[c] & \biglS(\triangle_{2})\cup\cdots\cup S(\triangle_{j1})\cup S(\triangle_{j})\bigr \\ & \quad = \biglS(\triangle_{2})\cup\cdots\cup S(\triangle_{j1})\bigr+\biglS(\triangle_{j})\bigr \geq\frac{n}{5} = \varTheta(n). \end{aligned} $$Then either the points inside region (△_{2}∪⋯∪△_{ j−1}) have high discrepancy, \(\delta (S(\triangle_{2})\cup\cdots\cup S(\triangle_{j1}) )\geq\frac{\sqrt[3]{n}}{20}\), and thus we can set \(C=\operatorname{Conv}{ (S(\triangle_{2})\cup\cdots \cup S(\triangle_{j1}) )}\), or the discrepancy in region (△_{2}∪⋯∪△_{ j−1}∪△_{ j }) is high,
$$\begin{aligned}[c] & \delta \bigl(S(\triangle_{2})\cup\cdots\cup S(\triangle_{j1}) \cup S(\triangle_j) \bigr) \\ & \quad \geq \delta\bigl(S(\triangle_j) \bigr)  \delta \bigl(S(\triangle_{2})\cup\cdots\cup S( \triangle_{j1}) \bigr) > \frac{\sqrt[3]{n}}{20} \end{aligned} $$and thus we can set \(C=\operatorname{Conv} (S(\triangle_{2})\cup\cdots \cup S(\triangle_{j1})\cup S(\triangle_{j}) )\). Both times the existence of a convex set C, with S∩C=Θ(n) and \(\delta(S\cap C)=\varOmega(\sqrt[3]{n})\), is a contradiction to its assumed nonexistence and consequently a contradiction to the assumed existence of some △_{ j }, 2≤j≤(h _{ i }−1), with \(\delta(S(\triangle_{j})) \geq \frac{\sqrt[3]{n}}{10}\).
By inequalities (3) and (6) we have
Hence, there exists a △_{ j }, such that \(R(\triangle_{j}) > \frac{3n}{10(h_{i}2)} > 3n^{2/3}\). Further, using inequality (7) and Observation 30 we have \(B(\triangle_{j}) < R(\triangle_{j}) + \frac{\sqrt[3]{n}}{10}\). Applying Lemma 14 for d=2 we know that there exist at least \(R(\triangle_{j}) + \sqrt{R(\triangle_{j})} +1\) interior disjoint red triangles, each with a point in \(\operatorname {CH}(\triangle_{j})\). At least
of these triangles are empty of points, and at least a third of them has the same point p in \(\operatorname{CH}(\triangle_{j})\) and thus in \(\operatorname{CH}(R_{i})\). Hence, p is a rich point.
If \(i<\frac{n}{5}\) then let S _{ i+1}=S _{ i }∖{p}, i=i+1, and iterate. As all triangles counted so far have p as a vertex, and p does not belong to the point sets of future iterations, we do not overcount. The process either terminates with a convex set C, such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(\sqrt[3]{n})\), or it ends after \(\frac{n}{5}\) steps. For each rich point we can count at least \(\frac{\sqrt[3]{n}}{3}\) empty red triangles. As we get \(\frac{n}{5}\) rich points and do not overcount we get \(\frac{n}{5}\cdot\frac{\sqrt[3]{n}}{3} = \varOmega(n^{4/3})\) empty red triangles in total. □
Combining Theorem 31 with Lemma 18 proves the bound of Ω(n ^{4/3}) empty monochromatic triangles for the 2colored case in the plane, already shown in [15]. However, Theorem 31 can be generalized to \(\mathbb{R}^{d}\):
Theorem 32
Let S be a bicolored set of n points in general position in \(\mathbb{R}^{d}\) (d≥2), partitioned into a red point set R and a blue point set B. Then either there exist Ω(n ^{d−2/3}) empty red dsimplices, or there exists a convex set C in \(\mathbb{R}^{d}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(\sqrt[3]{n})\).
Proof
We prove the theorem by induction on the dimension d (recall that d is a constant, independent of n), and use Theorem 31 as an induction base for d=2. Consider the induction step (d−1)⟶d, for d>2. If \(\delta(S)\geq\sqrt[3]{n}\) then \(C=\operatorname{Conv}(S)\) is the desired convex set, with S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(\sqrt[3]{n})\). Thus assume that \(\delta(S) < \sqrt[3]{n}\). From Observation 30 we know that \(R>\frac{n\sqrt[3]{n}}{2} = \varTheta(n)\).
Let p∈R be a red point. For every point q∈S∖{p} let r _{ q } be the infinite ray with origin p and passing through q. Let Π′ and Π″ be two (d−1)dimensional hyperplanes containing \(\operatorname{Conv}(S)\) between them and not parallel to any of the rays r _{ q }. See Fig. 6 (for the very similar proof of Theorem 28) for a sketch. Project from p every point in S∖{p} to Π′ or Π″, in the following way. Every ray r _{ q } intersects either Π′ or Π″ in a point q′ or q″, respectively. Take q′ or q″ to be the projection of q from p. Let S′ and S″ be the sets of these projected points in Π′ and Π″, respectively. The bigger set, assume w.l.o.g. S′ in Π′, is a set of at least \(\frac{n1}{2}\) points in general position in \(\mathbb{R}^{d1}\).
Apply the induction hypothesis to S′ and get either (a) Ω(n ^{d−1−2/3}) empty red (d−1)simplices, or (b) a convex set C in \(\mathbb{R}^{d1}\), such that S′∩C=Θ(n) and \(\delta(S'\cap C) = \varOmega(\sqrt[3]{n})\).
For case (b) observe, that the preimage of a point set of a convex set in Π′ is the point set of a convex set in \(\mathbb{R}^{d}\). Hence, C is a convex set in \(\mathbb{R}^{d}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(\sqrt[3]{n})\).
For case (a) note that, if X is the vertex set of an empty red (d−1)simplex in Π′, then \(\operatorname{Conv}(X\cup{p})\) is an empty red dsimplex in \(\mathbb{R}^{d}\). Repeat the projection and the induction for each red point p∈R and assume that this always results in case (a) (because the proof is completed if case (b) happens once). This results in a total of \(\frac{R}{d+1}\cdot\varOmega(n^{d12/3}) = \varOmega(n^{d2/3})\) empty red dsimplices, as each dsimplex gets overcounted at most (d+1) times. □
Combining Theorem 32 with the two variants of the “Discrepancy Lemma” for the bicolored case (Lemmas 18 and 20), allows us to generalize the bound on the number of empty monochromatic triangles for the bicolored case in the plane, to \(\mathbb{R}^{d}\).
Theorem 33
Any bicolored set S of n points in general position in \(\mathbb{R}^{d}\), d≥2, determines Ω(n ^{d−2/3}) empty monochromatic dsimplices.
Proof
By Theorem 32 either there exist Ω(n ^{d−2/3}) empty monochromatic dsimplices, or there exists a convex set C in \(\mathbb{R}^{d}\), such that S∩C=Θ(n) and \(\delta(S\cap C) = \varOmega(\sqrt[3]{n})\).
In the former case the theorem is proven. In the latter case, if d=2 then there exist Ω(n ^{2−1+1/3})=Ω(n ^{4/3}) empty monochromatic triangles (2simplices) by applying Lemma 18 to (S∩C), and if d>2 then there exist Ω(n ^{d−1+1/3})=Ω(n ^{d−2/3}) empty monochromatic dsimplices by applying Lemma 20 to (S∩C). □
Conclusions
In this paper we generalized known bounds on the number of empty monochromatic triangles and tetrahedra on colored point sets to higher dimensions. Our results are summarized in Table 1 (Sect. 1).
As main results, in Theorem 33, we proved that any bicolored point sets in \(\mathbb{R}^{d}\) determines Ω(n ^{d−2/3}) empty monochromatic dsimplices. For 3≤k≤d, in Theorem 29, we proved that any kcolored point set in \(\mathbb{R}^{d}\) determines \(\varOmega(n^{dk+12^{d}})\) empty monochromatic dsimplices. Further, we extended the linear lower bound for the number of empty monochromatic tetrahedra in 4colored point sets in \(\mathbb{R}^{3}\) to a linear lower bound for the number of empty monochromatic dsimplices in (d+1)colored point sets in \(\mathbb{R}^{d}\), Corollary 25.
Observe that in the “Generalized Discrepancy Lemma” (Lemma 19) in fact all empty monochromatic dsimplices of the provided bound are of the same color. This is also true for the Discrepancy Lemmas (Lemmas 18, 20, 21, 22, and 23) for small values of k and d, for which the “Generalized Discrepancy Lemma” is not applicable. As Corollary 26 is a direct consequence of Lemma 19, we can state that: Every kcolored set of \(n>k\cdot4^{d^{2}(d+1)}\) points in general position in \(\mathbb{R}^{d}\), with d≥k>3, determines Ω(n ^{d−k+1}logn) empty monochromatic dsimplices, which are all of the same color.
In order to prove our lower bounds on the number of empty monochromatic dsimplices, we proved a result that is interesting on its own right. Theorem 5 shows that a simplicial complex with at least \(dn+\max{ \{h,\frac{\log_{2}(n)}{2d} \}}c_{d}\), with c _{ d }=d ^{3}+d ^{2}+d, dsimplices exists for any point set in \(\mathbb{R}^{d}\) (points in general position).
Although still linear, this is a first nontrivial bound, of interest in view of the following open problem stated by Brass et al. [6]: What is the maximum number R _{ d }(n) such that every set of n points in general position in ddimensional space has a triangulation consisting of at least R _{ d }(n) simplices? Moreover, Urrutia [18] posed the following open problem:
Problem 34
Is it true that for any point set in general position in \(\mathbb {R}^{3}\) there exists a triangulation with super linear many 3simplices?
A positive answer to this question implies that any k coloring of a set of points with n elements in general position, always contains an empty monochromatic simplex, k constant, and n sufficiently large.
Unfortunately, proving or disproving Problem 34 seems to be illusive and remains open. On the other hand, it is well known that any set of n points on the momentum curve (x,x ^{2},x ^{3}) has a triangulation with a quadratic number of 3simplices. Aside from this, we are not aware of many families of point sets in general position in \(\mathbb{R}^{3}\) for which it is known that there exist triangulations with a quadratic number of 3simplices.
We close our paper with the following result that somehow suggests that any point set with n elements in \(\mathbb{R}^{d}\) is not far from a point set that generates a quadratic number of interior disjoint 3simplices:
Theorem 35
Any set X of n points in general position in \(\mathbb{R}^{3}\) is contained in a set S with 2n points in general position in \(\mathbb{R}^{3}\) such that S determines at least \({n \choose2}\) interior disjoint 3simplices.
Proof
Let v _{1},…,v _{ n } be n different unit vectors, no two of which are parallel to each other, nor parallel to any segment determined by any two elements of X. For each point p _{ i }, 1≤i≤n, in X let q _{ i }=p _{ i }+ε⋅v _{ i } be a point of S∖X, where ε is a small enough constant. Let \(\sigma_{i,j}=\operatorname{Conv}(\{p_{i},q_{i},p_{j},q_{j}\})\) be a 3simplex. As X is in general position, it is easy to see, that for all (i,j)≠(r,s) the 3simplices σ _{ i,j } and σ _{ r,s } have disjoint interior. □
Note that in many instances it will not be possible to complete the set of 3simplices obtained in the proof above to a full triangulation of S. Nevertheless, this shows that the families of point sets admitting a quadratic number of interior disjoint empty 3simplices may not have any special properties that would allow us to characterize them.
Clearly, the construction used in Theorem 35 can be generalized to higher dimensions. We conjecture:
Conjecture 1
For each d≥3 and every constant k, there exists a constant f(d,k) such that every set \(S \in\mathbb{R}^{d}\) of more than f(d,k) points with arbitrary kcoloring has a monochromatic empty dsimplex.
Even more so, we believe that the answer to Problem 34 is “Yes” and that this actually extends to higher dimensions.
Conjecture 2
For each d≥3 and every point set \(S \in\mathbb{R}^{d}\) there exists a triangulation with super linear many dsimplices.
Of course, proving this stronger Conjecture 2 would imply a proof for Conjecture 1: Construct a triangulation of super linear size on the biggest color class R⊆S. There exist only linear many differently colored points in S∖R to fill the super linear many monochromatic dsimplices on R. Hence, there exists at least one monochromatic empty dsimplex.
References
 1.
Aichholzer, O., FabilaMonroy, R., FloresPeñaloza, D., Hackl, T., Huemer, C., Urrutia, J.: Empty monochromatic triangles. Comput. Geom. 42(9), 934–938 (2009)
 2.
Bárány, I., Füredi, Z.: Empty simplices in Euclidean space. Can. Math. Bull. 30(4), 436–445 (1987)
 3.
Bárány, I., Valtr, P.: Planar point sets with a small number of empty convex polygons. Studia Sci. Math. Hung. 41(2), 243–266 (2004)
 4.
Barnette, D.: A proof of the lower bound conjecture for convex polytopes. Pac. J. Math. 46, 349–354 (1973)
 5.
Brass, P.: On the size of higherdimensional triangulations. In: Combinatorial and Computational Geometry, Math. Sci. Res. Inst. Publ., vol. 52, pp. 147–153. Cambridge Univ. Press, Cambridge (2005)
 6.
Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
 7.
Devillers, O., Hurtado, F., Károlyi, G., Seara, C.: Chromatic variants of the Erdős–Szekeres theorem on points in convex position. Comput. Geom. 26(3), 193–208 (2003)
 8.
Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161–166 (1950)
 9.
Dumitrescu, A.: Planar sets with few empty convex polygons. Studia Sci. Math. Hung. 36(1–2), 93–109 (2000)
 10.
Edelsbrunner, H., Preparata, F.P., West, D.B.: Tetrahedrizing point sets in three dimensions. J. Symb. Comput. 10, 335–347 (1990)
 11.
Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)
 12.
Katchalski, M., Meir, A.: On empty triangles determined by points in the plane. Acta Math. Hung. 51(3–4), 323–328 (1988)
 13.
Matoušek, J.: Using the Borsuk–Ulam Theorem. Universitext. Springer, Berlin (2003). Lectures on topological methods in combinatorics and geometry, written in cooperation with Anders Björner and Günter M. Ziegler
 14.
McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika 17, 179–184 (1970)
 15.
Pach, J., Tóth, G.: Monochromatic empty triangles in twocolored point sets. In: Garfunkel, S., Nath, R. (eds.) Geometry, Games, Graphs and Education: The Joe Malkevitch Festschrift, pp. 195–198 (2008)
 16.
Rothschild, B.L., Straus, E.G.: On triangulations of the convex hull of n points. Combinatorica 5(2), 167–179 (1985)
 17.
Tóth, G., Valtr, P.: The Erdős–Szekeres theorem: upper bounds and related results. In: Combinatorial and Computational Geometry. Math. Sci. Res. Inst. Publ., vol. 52, pp. 557–568. Cambridge Univ. Press, Cambridge (2005)
 18.
Urrutia, J.: Coloraciones, tetraedralizaciones, y tetraedros vacíos en coloraciones de conjuntos de puntos en \(\mathbb{R}^{3}\). In: Proc. X Encuentros de Geometría Computacional, pp. 95–100. Sevilla, España (2003)
 19.
Valtr, P.: On the minimum number of empty polygons in planar point sets. Studia Sci. Math. Hung. 30(1–2), 155–163 (1995)
Acknowledgements
We want to thank David FloresPeñaloza for valuable comments. We further thank an anonymous referee for helpful comments, which improved the presentation of the paper.
Research of Oswin Aichholzer supported by the ESF EUROCORES programme EuroGIGA—CRP ‘ComPoSe’, Austrian Science Fund (FWF): I648N18. Research of Ruy FabilaMonroy partially supported by CONACyT (Mexico) grant 153984. Research of Thomas Hackl supported by the Austrian Science Fund (FWF): P23629N18 ‘Combinatorial Problems on Geometric Graphs’. Research of Clemens Huemer partially supported by projects MTM200907242, Gen. Cat. DGR 2009SGR1040, and ESF EUROCORES programme EuroGIGA—CRP ‘ComPoSe’, MICINN Project EUIEURC20114306. Research of Jorge Urrutia partially supported by CONACyT (Mexico) grant CB2007/80268.
Author information
Rights and permissions
About this article
Cite this article
Aichholzer, O., FabilaMonroy, R., Hackl, T. et al. Empty Monochromatic Simplices. Discrete Comput Geom 51, 362–393 (2014). https://doi.org/10.1007/s0045401395652
Received:
Revised:
Accepted:
Published:
Issue Date:
Keywords
 Colored point sets
 Empty monochromatic simplices
 High dimensional triangulations
 Simplicial complex