In the classical setting, we aim at partitioning the vertices of a hypergraph
H
=
(
V
,
E
)
into two classes in such a way that ideally each hyperedge contains the same number of vertices in both classes. A partition into two classes can be represented by a coloring
χ
:
V
→
{
−
1
,
+
1
}
. We call -1 and +1 colors. The color-classes
χ
−
1
(
−
1
)
and
χ
−
1
(
+
1
)
form the corresponding partition. For a hyperedge
E
∈
E
, set
χ
(
E
)
:=
∑
v
∈
E
χ
(
v
)
.
The discrepancy of
H
with respect to
χ
and the discrepancy of
H
are defined by
d
i
s
c
(
H
,
χ
)
:=
max
E
∈
E
|
χ
(
E
)
|
,
d
i
s
c
(
H
)
:=
min
χ
:
V
→
{
−
1
,
+
1
}
d
i
s
c
(
H
,
χ
)
.
These notions as well as the term 'discrepancy' seem to have appeared for the first time in a paper of Beck. Earlier results on this problem include the famous lower bound on the discrepancy of arithmetic progressions by Roth and upper bounds for this problem and other results by Erdős and Spencer and Sárközi (described on p. 39). At that time, discrepancy problems were called quasi-Ramsey problems.
To get some intuition for this concept, let's have a look at a few examples.
If all edges of
H
intersect trivially, i.e.
E
1
∩
E
2
=
∅
for any two distinct edges
E
1
,
E
2
∈
E
, then the discrepancy is zero, if all edges have even cardinality, and one, if there is an odd cardinality edge.
The other extreme is marked by the complete hypergraph
(
V
,
2
V
)
. In this case the discrepancy is
⌈
1
2
|
V
|
⌉
. Any 2-coloring will have a color class of at least this size, and this set is also an edge. On the other hand, any coloring
χ
with color classes of size
⌈
1
2
|
V
|
⌉
and
⌊
1
2
|
V
|
⌋
proves that the discrepancy is not larger than
⌈
1
2
|
V
|
⌉
. It seems that the discrepancy reflects how chaotic the hyperedges of
H
intersect. Things are not that easy, however, as the following example shows.
Set
n
=
4
k
,
k
∈
N
and
H
n
=
(
[
n
]
,
{
E
⊆
[
n
]
∣
|
E
∩
[
2
k
]
|
=
|
E
∖
[
2
k
]
|
}
)
. Now
H
n
has many (more than
(
n
/
2
n
/
4
)
2
=
Θ
(
1
n
2
n
)
) complicatedly intersecting edges, but discrepancy zero.
The last example shows that we cannot expect to determine the discrepancy by looking at a single parameter like the number of hyperedges. Still, the size of the hypergraph yields first upper bounds.
d
i
s
c
(
H
)
≤
2
n
ln
(
2
m
)
.
with n the number of vertices and m the number of edges.
The proof is a simple application of the probabilistic method: Let
χ
:
V
→
{
−
1
,
1
}
be a random coloring, i.e. we have
Pr
(
χ
(
v
)
=
−
1
)
=
Pr
(
χ
(
v
)
=
1
)
=
1
2
independently for all
v
∈
V
. Since
χ
(
E
)
=
∑
v
∈
E
χ
(
v
)
is a sum of independent -1, 1 random variables. So we have
Pr
(
|
χ
(
E
)
|
>
λ
)
<
2
exp
(
−
λ
2
/
(
2
n
)
)
for all
E
⊆
V
and
λ
≥
0
. Put
λ
=
2
n
ln
(
2
m
)
for convenience. Then
Pr
(
d
i
s
c
(
H
,
χ
)
>
λ
)
≤
∑
E
∈
E
Pr
(
|
χ
(
E
)
|
>
λ
)
<
1.
Since a random coloring with positive probability has discrepancy at most
λ
, in particular, there are colorings that have discrepancy at most
λ
. Hence
d
i
s
c
(
H
)
≤
λ
.
◻
For any hypergraph
H
such that
m
≥
n
we have
d
i
s
c
(
H
)
=
O
(
n
)
.
To prove this, a much more sophisticated approach using the entropy function was necessary. Of course this is particularly interesting for
m
=
O
(
n
)
. In the case
m
=
n
,
d
i
s
c
(
H
)
≤
6
n
can be shown for n large enough. Therefore, this result is usually known to as 'Six Standard Deviations Suffice'. It is considered to be one of the milestones of discrepancy theory. The entropy method has seen numerous other applications, e.g. in the proof of the tight upper bound for the arithmetic progressions of Matoušek and Spencer or the upper bound in terms of the primal shatter function due to Matoušek.
Assume that each vertex of
H
is contained in at most t edges. Then
d
i
s
c
(
H
)
<
2
t
This result, the Beck–Fiala theorem, is due to Beck and Fiala. They bound the discrepancy by the maximum degree of
H
. It is a famous open problem whether this bound can be improved asymptotically (modified versions of the original proof give 2t-1 or even 2t-3). Beck and Fiala conjectured that
d
i
s
c
(
H
)
=
O
(
t
)
, but little progress has been made so far in this direction. Bednarchak and Helm and Helm improved the Beck-Fiala bound in tiny steps to
d
i
s
c
(
H
)
≤
2
t
−
3
(for a slightly restricted situation, i.e.
t
≥
3
). A corollary of Beck's paper – the first time the notion of discrepancy explicitly appeared – shows
d
i
s
c
(
H
)
≤
C
t
log
m
log
n
for some constant C. The latest improvement in this direction is due to Banaszczyk:
d
i
s
c
(
H
)
=
O
(
t
log
n
)
.
Axis-parallel rectangles in the plane (Roth, Schmidt)
Discrepancy of half-planes (Alexander, Matoušek)
Arithmetic progressions (Roth, Sárközy, Beck, Matoušek & Spencer)
Beck–Fiala theorem
Six Standard Deviations Suffice (Spencer)
Axis-parallel rectangles in dimensions three and higher (Folklore)
Komlos conjecture
Numerical Integration: Monte Carlo methods in high dimensions.
Computational Geometry: Divide and conquer algorithms.
Image Processing: Halftoning
