bernoulli systems
Recently Published Documents


TOTAL DOCUMENTS

14
(FIVE YEARS 2)

H-INDEX

4
(FIVE YEARS 0)

2021 ◽  
pp. 1-18
Author(s):  
DOU DOU ◽  
KYEWON KOH PARK

Abstract Entropy dimension is an entropy-type quantity which takes values in $[0,1]$ and classifies different levels of intermediate growth rate of complexity for dynamical systems. In this paper, we consider the complexity of skew products of irrational rotations with Bernoulli systems, which can be viewed as deterministic walks in random sceneries, and show that this class of models can have any given entropy dimension by choosing suitable rotations for the base system.


2011 ◽  
Vol 44 (37) ◽  
pp. 375101
Author(s):  
A Akaishi ◽  
M Hirata ◽  
K Yamamoto ◽  
A Shudo
Keyword(s):  

2008 ◽  
Vol 28 (1) ◽  
pp. 87-124 ◽  
Author(s):  
A. H. DOOLEY ◽  
V. YA. GOLODETS ◽  
D. J. RUDOLPH ◽  
S. D. SINEL’SHCHIKOV

AbstractA new approach to actions of countable amenable groups with completely positive entropy (cpe), allowing one to answer some basic questions in this field, was recently developed. The question of the existence of cpe actions which are not Bernoulli was raised. In this paper, we prove that every countable amenable groupG, which contains an element of infinite order, has non-Bernoulli cpe actions. In fact we can produce, for any$h \in (0, \infty ]$, an uncountable family of cpe actions of entropyh, which are pairwise automorphically non-isomorphic. These actions are given by a construction which we call co-induction. This construction is related to, but different from the standard induced action. We study the entropic properties of co-induction, proving that ifαGis co-induced from an actionαΓof a subgroup Γ, thenh(αG)=h(αΓ). We also prove that ifαΓis a non-Bernoulli cpe action of Γ, thenαGis also non-Bernoulli and cpe. Hence the problem of finding an uncountable family of pairwise non-isomorphic cpe actions of the same entropy is reduced to one of finding an uncountable family of non-Bernoulli cpe actions of$\mathbb Z$, which pairwise satisfy a property we call ‘uniform somewhat disjointness’. We construct such a family using refinements of the classical cutting and stacking methods.


Author(s):  
Philip Feinsilver ◽  
René Schott
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document