Paradoxical decompositions and finitary colouring rules
Robert Samuel Simon, Grzegorz Tomkowicz

TL;DR
This paper introduces paradoxical colouring rules linked to measure-theoretic paradoxes, showing that proper vertex colouring can exhibit paradoxical properties, thus revealing new insights into combinatorial and measure-theoretic interactions.
Contribution
It defines paradoxical colouring rules and establishes their connection to measure-theoretic paradoxes, demonstrating that proper vertex colouring can be paradoxical.
Findings
Proper vertex colouring can be paradoxical.
Paradoxical colouring rules relate to measure-theoretic paradoxes.
The paper establishes a formal connection between colouring rules and paradoxical decompositions.
Abstract
We define "paradoxical colouring rule", show its relation to measure theoretic paradoxes, and demonstrate that proper vertex colouring can be a paradoxical colouring rule.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Algebra and Logic
