Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Yuasa, Hisatoshi"'
We complete statement and proof for B. Moss\'e's unilateral recognizability theorem. We also provide an algorithm for deciding the unilateral non-recognizability of a given primitive substitution.
Comment: 18 pages, 2 figures
Comment: 18 pages, 2 figures
Externí odkaz:
http://arxiv.org/abs/1801.03536
Autor:
Yuasa, Hisatoshi
We prove a model theorem for factor maps between ergodic, infinite measure-preserving systems.
Comment: 22 pages, 5 figures
Comment: 22 pages, 5 figures
Externí odkaz:
http://arxiv.org/abs/1709.05387
Autor:
Yuasa, Hisatoshi
The concept of a uniform set is introduced for an ergodic, measure-preserving transformation on a non-atomic, infinite Lebesgue space. The uniform sets exist as much as they generate the underlying $\sigma$-algebra. This leads to the result that any
Externí odkaz:
http://arxiv.org/abs/1108.0625
Autor:
Yuasa, Hisatoshi
We consider a homeomorphism on a totally disconnected, compact metric space and define a binary relation on the family of clopen subsets. We will show that the comparability of any clopen sets with respect to the relation is equivalent to the unique
Externí odkaz:
http://arxiv.org/abs/1008.0180
Autor:
Hama, Masaki, Yuasa, Hisatoshi
The class of substitutions of some primitive components is introduced. A bilateral subshift arising from a substitution of some primitive components is decomposed into pairwise disjoint, locally compact, shift-invariant sets, on each of which an inva
Externí odkaz:
http://arxiv.org/abs/1003.3364
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Yuasa, Hisatoshi
Publikováno v:
数理解析研究所講究録別冊. :97-116
The main part of this article is a survey of a complete characterization of linearly recurrent sequences in terms of S-adic sequences which is due to F. Durand (2000, 2003). However, we also discuss almost minimal sequences in connections with S-adic
We complete statement and proof for B. Moss��'s unilateral recognizability theorem. We also provide an algorithm for deciding the unilateral non-recognizability of a given primitive substitution.
18 pages, 2 figures
18 pages, 2 figures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d0bbbdee9355e573bdc254910160370
Autor:
Yuasa, Hisatoshi
Publikováno v:
数理解析研究所講究録. 1179:1-5
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.