A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids

DOI10.2178/JSL.7704060zbMATH Open1270.03081OpenAlexW2058777475MaRDI QIDQ4899166FDOQ4899166

James H. Schmerl

Publication date: 7 January 2013

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1350315581

Recommendations

• Coloring grids
• On the grid Ramsey problem and related questions
• Acceptable colorings of indexed hyperspaces
• Some Ramsey-type results for the \(n\)-cube
• Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
• scientific article
• Ramsey properties of products of chains
• Countable decompositions of \({\mathbb{R}}^2\) and \({\mathbb{R}}^3\)
• A Decomposition Theorem for R n
• scientific article; zbMATH DE number 1241845

zbMATH Keywords

structurecontinuum hypothesisparadoxical decompositionsacceptable coloringsemialgebraic \(n\)-grid

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Continuum hypothesis and Martin's axiom (03E50)

Cites Work

• Another characterization of alephs: Decompositions of hyperspace
• Countable partitions of Euclidean space
• Avoidable algebraic subsets of Euclidean space
• Sur une propriété paradoxale de l'espace à trois dimensions équivalente à l'hypothèse du continu
• Covering the plane with sprays
• Three clouds may cover the plane
• Decompositions of the plane and the size of the continuum
• How many clouds cover the plane?
• A Proposition of Elementary Plane Geometry that Implies the Continuum Hypothesis

Cited In (3)

• Coloring grids
• ACCEPTABLE COLORINGS OF INDEXED HYPERSPACES
• Semialgebraic graphs having countable list-chromatic numbers

This page was built for publication: A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899166)