Henk Bruin

dblp:90/1104 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0002-4033-5206ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2023 Classification of One dimensional dynamical Systems by Countable Structures
abstract
Abstract We study the complexity of the classification problem of conjugacy on dynamical systems on some compact metrizable spaces. Especially we prove that the conjugacy equivalence relation of interval dynamical systems is Borel bireducible to isomorphism equivalence relation of countable graphs. This solves a special case of Hjorth’s conjecture which states that every orbit equivalence relation induced by a continuous action of the group of all homeomorphisms of the closed unit interval is classifiable by countable structures. We also prove that conjugacy equivalence relation of Hilbert cube homeomorphisms is Borel bireducible to the universal orbit equivalence relation.
Henk Bruin, Benjamin Vejnar
J. Symb. Log.1
2005 The complexity of Fibonacci-like kneading sequences
Henk Bruin, Oksan Volkova
Theor. Comput. Sci.1