1999 | OriginalPaper | Chapter
Combinatorial Discrepancy
Author : Jiří Matoušek
Published in: Geometric Discrepancy
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this chapter, we are going to investigate the combinatorial discrepancy, an exciting and significant subject in its own right. From Section 1.3, we recall the basic definition: If X is a finite set and S ⊑ 2X is a family of sets on X,a coloring is any mapping $$x:X \to \left\{ { - 1, + 1} \right\}$$, and we have disc $$\left( S \right) = {\min _x}{\max _{s \in s}}|x\left( S \right)|,$$, where $$\sum {_{x \in S}x\left( x \right)} .$$