Timeline for Equivalence relations that are both not treeable and amenable
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2015 at 16:12 | history | edited | Vladimir | CC BY-SA 3.0 |
Edited to weaken the conjecture.
|
| Jun 16, 2015 at 0:26 | comment | added | Vladimir | Greg Hjorth's paper "Non-treeability for product group actions" is a good place to read the definition for a general (uncountable) treeable equivalence relation. Essentially it is the same definition as in the countable case. | |
| Jun 15, 2015 at 20:58 | comment | added | Vladimir | Thanks, R W! I'm not sure I understand your question, or how it relates to mine. Could you elaborate? To clarify, by amenable equivalence relation I mean in the sense of Connes-Feldman-Weiss (e.g., Borel reducible to a hyperfinite equivalence relation, or an orbit equivalence relation of an amenable group). | |
| Jun 15, 2015 at 19:18 | comment | added | R W | To begin with, how does one make treeable an amenable foliation? | |
| Jun 15, 2015 at 17:00 | history | asked | Vladimir | CC BY-SA 3.0 |