Reconstruction of a coloring from its homogeneous sets
Abstract
We study a reconstruction problem for colorings. Given a finite or countable set X, a coloring on X is a function : [X]2 \0,1\, where [X]2 is the collection of all 2-elements subsets of X. A set H⊂eq X is homogeneous for when is constant on [H]2. Let hom() be the collection of all homogeneous sets for . The coloring 1- is called the complement of . We say that is reconstructible up to complementation from its homogeneous sets, if for any coloring on X such that hom()=hom() we have that either = or =1-. We present several conditions for reconstructibility and non reconstructibility. We show that there is a Borel way to reconstruct a coloring from its homogeneous sets.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.