6 citations · 15 across the 20 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2026
Classification complexity of homeomorphism group actions
Michal Hevessy, Benjamin Vejnar
In this paper, we study how the classification complexity of natural orbit equivalence relations changes when the full homeomorphism group of a compact metrizable space is replaced…
math.LO2007★ 6 cited
Covering an uncountable square by countably many continuous functions
Wiesław Kubiś, Benjamin Vejnar
We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form …