Hereditary Discrepancies in Different Numbers of Colors II
Abstract
We bound the hereditary discrepancy of a hypergraph in two colors in terms of its hereditary discrepancy in c colors. We show that (,2) K c (,c), where K is some absolute constant. This bound is sharp.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.