Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Bryna Kra"'
Publikováno v:
Forum of Mathematics, Sigma, Vol 3 (2015)
For a finite alphabet ${\mathcal{A}}$ and shift $X\subseteq {\mathcal{A}}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group $\text{Aut}(X)$. For such systems, we show th
Externí odkaz:
https://doaj.org/article/3bd81a36ef4b4978b84831b607ff5adb
Autor:
John Franks, Bryna Kra
Publikováno v:
Proceedings of the London Mathematical Society. 121:252-286
We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on finitely many
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b550727254a41246f80ffe98efa964f
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group, study its al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::825c534578a2e6d1654e0873d9df8039
Publikováno v:
Journal of modern dynamics
Journal of modern dynamics, American Institute of Mathematical Sciences, 2018, 13 (1), pp.147-161. ⟨10.3934/jmd.2018015⟩
Journal of modern dynamics, American Institute of Mathematical Sciences, 2018, 13 (1), pp.147-161. ⟨10.3934/jmd.2018015⟩
The set of automorphisms of a one-dimensional subshift \begin{document} $(X, σ)$ \end{document} forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We pr
Autor:
Bryna Kra
Publikováno v:
Bulletin of the American Mathematical Society. 55:343-345
Immediately following the commentary below, this previously published article is reprinted in its entirety: D. Ornstein and B. Weiss, “Ergodic theory of amenable group actions, I. The Rohlin Lemma”, Bull. Amer. Math. Soc. (N.S.) 2 (1980), no. 1,
A subshift with linear block complexity has at most countably many ergodic measures, and we continue the study of the relation between such complexity and the invariant measures. By constructing minimal subshifts whose block complexity is arbitrarily
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c44f478ecdc590db448dd62ae244c1d3
http://arxiv.org/abs/1902.08645
http://arxiv.org/abs/1902.08645
Autor:
Bryna Kra, Jon Chaika
We construct a rigid, rank 1, prime transformation that is not quasi-simple and whose self-joinings form a Paulsen simplex. This seems to be the first example of a prime system whose self-joinings form a Paulsen simplex.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3989db2109fa5a7b213dd35bc8dec0e5
Publikováno v:
Journal of Modern Dynamics. 10:483-495
The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the direct sum
Publikováno v:
Proceedings of the American Mathematical Society. 145:1163-1173
Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on [ 0 , 1 ) [0,1) which is invariant under both x ↦ p x ( m