The complexity of topological conjugacy of pointed Cantor minimal systems

Download

index.pdf

Date

2017-05-01

Author

Kaya, Burak

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

244
views

89
downloads

In this paper, we analyze the complexity of topological conjugacy of pointed Cantor minimal systems from the point of view of descriptive set theory. We prove that the topological conjugacy relation on pointed Cantor minimal systems is Borel bireducible with the Borel equivalence relation Delta(+)(R) on R-N defined by x Delta(+)(R)y double left right arrow {x(i):i is an element of N} = {y(i):i is an element of N}. Moreover, we show that Delta(+)(R) is a lower bound for the Borel complexity of topological conjugacy of Cantor minimal systems. Finally, we interpret our results in terms of properly ordered Bratteli diagrams and discuss some applications.

Subject Keywords

Borel complexity, Topological conjugacy, Cantor minimal systems, Bratteli diagrams

URI

https://hdl.handle.net/11511/36416

Journal

ARCHIVE FOR MATHEMATICAL LOGIC

DOI

https://doi.org/10.1007/s00153-017-0534-y

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

THE COMPLEXITY OF THE TOPOLOGICAL CONJUGACY PROBLEM FOR TOEPLITZ SUBSHIFTS Kaya, Burak (2017-06-01) In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show that the topological conjugacy relation is hyperfinite on a larger class of Toeplitz subshifts which we call Toeplitz subshifts with growing blocks. This result provides a partial answer to a question asked by Sabok and Tsankov.
An evolutionary algorithm for multiple criteria problems Soylu, Banu; Köksalan, Murat; Department of Industrial Engineering (2007) In this thesis, we develop an evolutionary algorithm for approximating the Pareto frontier of multi-objective continuous and combinatorial optimization problems. The algorithm tries to evolve the population of solutions towards the Pareto frontier and distribute it over the frontier in order to maintain a well-spread representation. The fitness score of each solution is computed with a Tchebycheff distance function and non-dominating sorting approach. Each solution chooses its own favorable weights accordin...
The Marginal Enumeration Bayesian Cramer-Rao Bound for Jump Markov Systems FRITSCHE, Carsten; Orguner, Umut; Svensson, Lennart; Gustafsson, Fredrik (2014-04-01) A marginal version of the enumeration Bayesian Cramer-Rao Bound (EBCRB) for jump Markov systems is proposed. It is shown that the proposed bound is at least as tight as EBCRB and the improvement stems from better handling of the nonlinearities. The new bound is illustrated to yield tighter results than BCRB and EBCRB on a benchmark example.
The Lie algebra sl(2,R) and so-called Kepler-Ermakov systems Leach, PGL; Karasu, Emine Ayşe (Informa UK Limited, 2004-05-01) A recent paper by Karasu (Kalkanli) and Yildirim (Journal of Nonlinear Mathematical Physics 9 (2002) 475-482) presented a study of the Kepler-Ermakov system in the context of determining the form of an arbitrary function in the system which was compatible with the presence of the sl(2, R) algebra characteristic of Ermakov systems and the existence of a Lagrangian for a subset of the systems. We supplement that analysis by correcting some results.
The effect of design patterns on object-oriented metrics and software error-proneness Aydınöz, Barış; Bilgen, Semih; Department of Electrical and Electronics Engineering (2006) This thesis study investigates the connection between design patterns, OO metrics and software error-proneness. The literature on OO metrics, design patterns and software error-proneness is reviewed. Different software projects and synthetic source codes have been analyzed to verify this connection.

Citation Formats

B. Kaya, “The complexity of topological conjugacy of pointed Cantor minimal systems,” ARCHIVE FOR MATHEMATICAL LOGIC, pp. 215–235, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36416.