Coloring redundant algebraic hypergraphs
Abstract
We prove several consistency results in choiceless set theory ZF+DC regarding countable chromatic numbers of various algebraic hypergraphs on Euclidean spaces.
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.