Paradoxical Decompositions

2016 ◽  
pp. 131-144
Author(s):  
Joel H. Shapiro
Keyword(s):  
Paradoxical Decompositions

scholarly journals Baire measurable paradoxical decompositions via matchings

2016 ◽  
Vol 289 ◽  
pp. 397-410 ◽  
Author(s):  
Andrew Marks ◽  
Spencer Unger
Keyword(s):  
Paradoxical Decompositions

Paradoxical Decompositions and Growth Conditions

2005 ◽  
Vol 14 (1) ◽  
pp. 81-105 ◽  
Author(s):  
GÁBOR ELEK ◽  
VERA T. SÓS
Keyword(s):  
Growth Conditions ◽  
Paradoxical Decompositions

scholarly journals INFINITE COMBINATORICS PLAIN AND SIMPLE

2018 ◽  
Vol 83 (3) ◽  
pp. 1247-1281 ◽  
Author(s):  
DÁNIEL T. SOUKUP ◽  
LAJOS SOUKUP
Keyword(s):  
Chromatic Number ◽  
Set Theory ◽  
Wide Applicability ◽  
Elementary Submodels ◽  
Set Systems ◽  
Point Set ◽  
Infinite Combinatorics ◽  
Sparse Set ◽  
Paradoxical Decompositions ◽  
General Method

AbstractWe explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already, we significantly broaden this framework by developing the corresponding technique for countably closed models of size continuum. The applications range from various theorems on paradoxical decompositions of the plane, to coloring sparse set systems, results on graph chromatic number and constructions from point-set topology. Our main purpose is to demonstrate the ease and wide applicability of this method in a form accessible to anyone with a basic background in set theory and logic.

Sign in / Sign up

Export Citation Format

Share Document