Set–theoretical entropies of weighted generalized shifts
Abstract.
In this paper for a finite field , a nonempty set , a self–map and a weight vector , we show that the set–theoretical entropy of the weighted generalized shift is either zero or , moreover it is equal to zero if and only if is quasi–periodic. On the other hand after characterizing all conditions under which is of finite fibre, we show that the contravariant set–theoretical entropy of a finite fibre depends only on and . In final sections we study the restriction of to the direct sum .
2020 Mathematics Subject Classification: 03E20, 37B99
Keywords: Contravariant set– theoretical entropy, Covariant set–theoretical entropy, Infinite anti–orbit number, Infinite orbit number, Weighted generalized shift.
1. Introduction
As it has been mentioned in several texts “Entropy”
could be defined as the (numerical) value of dynamicity/
uncertainty/ complexity in a system. Let’s name some types of
entropy: measure entropy [13, 19, 20],
topological entropy [1, 2], algebraic
entropy [10, 21], adjoint entropy [9].
Bernoulli shifts and entropy are the common interests of many not only old researches [15, 16], but also new ones [17].
According to the preface of [18],
Ornstein (and others) have shown
“that a large class of transformations of physical
and mathematical interest are isomorphic to Bernoulli shifts”.
During the works of Ornstein and other mathematicains, we sense strongly that
Bernoulli shifts are classical and the simplest examples in ergodic and entropy theory (see e.g. the third paragraph of [15]).
Without any doubt, the left Bernoulli shift
and two–sided Bernoulli shift have great part to inspiring generalized shift.
“Generalized shifts” form a class of examples inspired by Bernoulli
shifts, Bernoulli shifts are special generalized shifts and there are
several papers dedicated to compute the entropy of generalized
shifts [3, 4, 14]. “Weighted generalized shifts” are a further generalization of generalized shifts,
in functional analysis and complex analysis courses
they are known as weighted composition operators, under a different point of view
(see subsection 2.2).
Amongst different types of entropy, we study the covariant and the contravariant set–theoretical entropies of self–maps of a nonempty set
(see subsection 2.1) with a focus on the weighted generalized shifts.
Let’s bring our main results in this stage accompanying with their full assumptions.
For a finite field , a nonempty set , an arbitrary self–map and a weight vector
also
, our results
on the weighted generalized shift
can be divided into types “structural results” and “numerical results”. As the structural results
we show:
- -
-
-
the weighted generalized shift is of finite fibre, if and only if is finite,
-
-
if and only if is of finite fibre. Moreover, in this case, is of finite fibre if and only if is of finite fibre,
In the numerical results, we compute covariant and contravariant set–theoretical entropies of , i.e.:
-
-
covariant set–theoretical entropy of the weighted generalized shift has no finite values different from zero, moreover it takes value zero if and only if is quasi–periodic,
-
-
contravariant set–theoretical entropy of the finite fibre weighted generalized shift has no finite values different from zero, as a matter of fact if and only if one of the following conditions occurs:
-
a.
has a non–quasi–periodic point in ,
-
b.
all points of are quasi–periodic points of and ,
-
a.
-
-
In addition whenever , then:
-
a.
covariant set–theoretical entropy of has no finite values different from zero, moreover it takes if and only if there exists a one to one anti–orbit sequence in ,
-
b.
contravariant set–theoretical entropy of finite fibre has no finite values different from zero, moreover it takes if and only if there exists a one to one orbit sequence in .
-
a.
2. Some required backgrounds
Covariant set–theoretical entropy, contravariant set–theoretical entropy and weighted generalized shifts are our main objects in this paper. Let’s have a glance at them via the following two subsections which are followed by a subsection devoted to primary notations.
2.1. Background on covariant set–theoretical and contravariant set–theoretical entropies
For a nonempty set and a self–map , we say that the sequence is:
-
•
an orbit, if for each , we have ,
-
•
an anti–orbit, if for each , we have ,
-
•
one to one if for all .
The string number or infinite orbit number of self–map is [3, 7]:
and the antistring number or infinite anti–orbit number of self–map is [4, 7]:
For a finite subset of let (whereby we mean the cardinality of ):
where the limit exists by [4, Lemma 2.6], and we call is a
finite subset of , covariant set–theoretical entropy of (or briefly
set–theoretical entropy of ),
moreover, [4, Proposition 2.16]. Set–theoretical entropy of a
self–map has been introduced for the first time in [4].
On the other hand for , we have so
as surjective core of is the biggest subset of , such that
is surjective.
Also the sequence is an anti–orbit if and only if it is an
anti–orbit, hence .
Let’s mention that is of finite fibre if is finite for all .
For a surjective finite fibre
and a finite subset of , let
then we call is a finite subset of , contravariant set–theoretical entropy of , moreover . So for a finite fibre self–map , we may consider contravariant set–theoretical entropy of as , see [8, Definition 3.2.18, Definition 3.2.19, Proposition 3.2.34, Theorem 3.2.39].
2.2. Background on generalized and weighted generalized shifts
Let’s recall that for the nonempty sets and the self–map ,
the generalized shift
with
has been introduced for the first time in [6] as a
generalization of the left Bernoulli shift and the two–sided shift.
Moreover, for a bounded vector , the weighted shift
with is of great interest in functional analysis.
Weighted generalized shifts can be considered as a common generalization of weighted shifts and generalized shifts in the following way:
Suppose is a module over ring , is a nonempty
set, is an arbitrary self–map, and
, then we call
with
a weighted generalized
shift [5], moreover . Also if is the unit element of
and , then
.
For the connections between topological (algebraic) entropy and set– theoretical entropies in generalized shifts see [7].
In other point of view for computing the topological, algebraic and set–theoretical entropies of a generalized shift see [3, 4, 12, 14].
2.3. Primary notations
Let’s recall that for ,
-
•
is the collection of fixed points of ,
-
•
is the collection of periodic points of ,
-
•
if , then is the period of (w.r.t. ),
-
•
is the collection of quasi–periodic points of ,
-
•
is the collection of non–quasi–periodic points of ,
-
•
is periodic if there exists with ,
-
•
is quasi–periodic if there exists with ,
-
•
is pointwise periodic (resp. pointwise quasi–periodic) if (resp. ).
Also note that .
Moreover, if and only if for all distinct we have
, i.e. is one to one. Therefore is
one to one.
Now we show is
infinite.
Let , then is one to one, therefore is infinite.
So is
infinite. On the other hand if , choose with , then
in particular is finite and
is
finite. Therefore is
infinite.
Example 2.1.
Consider with , for and . So:
is pointwise periodic and so also pointwise quasi–periodic, however, it is neither periodic nor quasi–periodic.
Convention 2.2.
In the following text consider finite field a , a nonempty set , a self–map , a weight vector and the weighted generalized shift (so for each ). For and , let
Also, let (where is the identity map on ):
In we search for s such that
forms a linear vector space over of dimension . Moreover if , then for each .
3. Set–theoretical entropy of
In this section we prove , moreover if and only if is quasi–periodic. Hence, is pointwise quasi–periodic if and only if it is quasi–periodic. Note that, for we have .
Lemma 3.1.
Consider and ,
then .
Also for all , we have
,
i.e.
(3.1) |
On the other hand, (for all ).
Proof.
In the following lemma, we characterize the quasi–periodic weighted generalized shifts in terms of .
Lemma 3.2.
The following statements are equivalent:
-
1.
is quasi–periodic,
-
2.
there exist such that, for any , we have or ,
-
3.
.
Proof.
(1 2): For , suppose and consider such that . Choose such that and , then
in particular
using and
we conclude that .
(2 3): If (2) holds, then
.
(3 1): Suppose
is finite, let
We prove that is quasi–periodic
via the following 2 claims.
Claim A.
For and for some
if ,
then
Proof of Claim A. Note that is a multiplicative group with elements and identity , thus for each , hence for all , so
Claim B. Let and , then:
Proof of Claim B. Using the definition of , for every , . By the definition of and , we have:
If , then
On the other hand, if , then there exists such that , thus with . Since , so . Moreover, , therefore divides which shows . By Claim A we have thus:
therefore . So (use ):
which completes the proof of Claim B.
Now we are ready to complete the proof of Lemma 3.2. Indeed, by Claim B we have
which means that is quasi–periodic.
∎
In order to have intuition on weighted generalized shifts with infinite set-theoretical entropy in the following example we bring a one to one map without any periodic point and a pointwise quasi–periodic such that for both maps has infinite set-theoretical entropy.
Example 3.3.
Consider with (for ) and as in Example 2.1. Also let:
then for , the sequences are pairwise disjoint one to one sequences.
Theorem 3.4.
For the weighted generalized shift we have:
Proof.
We already know that the quasi–periodicity implies the pointwise quasi–periodicity of
, which means
that . So it remains to prove that
non–quasi–periodicity of implies
.
Suppose is not quasi–periodic, then by Lemma 3.2 we have
. We aim to prove that
.
Using induction choose
a sequence () in the following way:
-
•
there exists such that ,
-
•
for , suppose have been chosen such that are pairwise disjoint. There exists with . Suppose
is equal to: with
,
then and
since and there exists with , thus:
(3.5) let , then and by 3.5
are pairwise disjoint sets.
Using the above inductive construction
is a
collection of pairwise disjoint sets and for all ,
, we have in particular
.
For , suppose is the th prime number and let:
For convenience let
We claim that is a collection of pairwise disjoint one to one sequences. For this aim, consider with , we show:
using the following cases:
Case 1. . Without any loss of generality we may suppose . Choose with
, then
Also (use the way of choosing s)
And
So
and .
Case 2. and . We may suppose . Then:
and
so
and .
Using the above cases
is
a collection of pairwise disjoint one to one sequences, thus
.
∎
Corollary 3.5.
is quasi–periodic if and only if it is pointwise quasi–periodic.
Proof.
We have if and only if is pointwise quasi–periodic, now use Theorem 3.4. ∎
4. Contravariant set–theoretical entropy of
finite fibre
Since is an endomorphism of the abelian additive group , by [11, Theorem A] we have . In this section we characterize and show that for a finite fibre depends only on and . In this section let:
Note that .
Example 4.1.
If , then is just a generalized shift moreover for this case , and .
Lemma 4.2.
.
Proof.
Consider and , so there exists with . Since there exists with . In particular
which completes the proof. ∎
Let’s call subset of , invariant if .
Lemma 4.3.
If is a invariant subset of , then for all .
Proof.
For , we have:
∎
Note that for , if is an anti-orbit sequence, then .
Corollary 4.4.
.
Proof.
If , then by Lemma 4.2
we have . So
.
Now suppose . For if
are one to
one anti-orbit disjoint
sequences, by Lemma 4.2 the map is one to one, then
are one to one disjoint sequences. On the other hand, by
Lemma 4.3,
are
anti-orbit
sequences. Hence
.
For each , define
with
for all
and
for all , so if
are one to
one
anti-orbit
disjoint sequences, then
are one to one disjoint sequences too. Consider
. By 4.2, for each
we have:
(4.1) |
therefore:
Thus for all , which shows are anti-orbit sequences too. Hence . ∎
Lemma 4.5.
If , then .
Proof.
Suppose , then by Lemma 3.2, there exist with . If is a anti-orbit sequence, then and is not one to one, thus . ∎
4.1. An equivalence relation
For , let if there exists with .
Then is an equivalence relation on . Note that if , then there exists with hence , therefore
.
To the above discussion
is well–defined.
By [14, Lemma 3.5], , so and
are useful to computing contravariant set–theoretical entropy of finite fibre .
Let’s bring some properties of and .
Remark 4.6.
Lemma 4.7.
We have:
-
•
,
-
•
for each .
Proof.
Consider with , then . So with . Also and there exists with , thus and , which leads to . Thus:
and
Now let with , there exists with , thus and , thus there exists with , hence , therefore and which shows and completes the proof. ∎
Lemma 4.8.
The following statements are equivalent:
-
1.
is of finite fibre,
-
2.
is finite,
-
3.
There exists , such that for each , we have .
In particular, if for each , , then the following statements are equivalent:
-
•
is of finite fibre,
-
•
is of finite fibre,
-
•
is a finite set.
Proof.
Consider , then:
Hence and are equipotent. Therefore is of finite fibre if and only if is finite. ∎
Corollary 4.9.
If is of finite fibre, then and are of finite fibre too.
Proof.
Suppose is of finite fibre, then by Lemma 4.8,
is finite. Hence is finite too. So
by Lemma 4.8, is of finite fibre.
Moreover, for
,
is of
finite fibre too. On the other hand, for each
we have:
(4.2) |
So for each the following implications are valid:
Thus , and is of finite fibre. Since is bijective and , we have the desired result. ∎
In the above corollary stemmed from Lemma 4.8, if is of finite fibre, then is of finite fibre too, the following counterexample shows that the reversed the implication is not true.
Counterexample 4.10.
Let , , and for . Then and is of finite fibre while is infinite, hence is not of finite fibre.
4.2. Towards computing
By Lemma 4.8, is of finite fibre if and only if is finite.
Convention 4.11.
In this subsection suppose is of finite fibre, i.e. is finite.
Finite fibreness of leads us to the following corollaries.
Corollary 4.12.
.
Proof.
Use Corollary 4.4. ∎
Corollary 4.13.
If , then .
Proof.
Use Lemma 4.5. ∎
In the following propositions, we restrict ourselves to conditions which make us closer to ’s situation. Also we will use and in the proof of the following theorem.
Theorem 4.14.
Suppose and at least one of the following conditions occurs:
-
•
has a non–quasi–periodic point ,
-
•
and ,
then .
Proof.
For , let:
(4.3) |
Consider with (). For each , we have:
Hence and the following diagram commutes:
It’s evident that is surjective, moreover, by Corollary 4.9, is of finite fibre. By [8, Lemma 3.2.22 (b)] we have:
(4.4) |
By Lemma 4.7, at least one of the following
conditions occurs:
has a non–quasi periodic point in ,
and
,
then by [14, Corollary 3.9]
(4.5) |
Lemma 4.15.
Suppose , and , then:
-
1.
is bijective,
-
2.
with , is bijective,
-
3.
.
Proof.
Using we have . therefor
, since .
1) Note that , moreover, for each
, we have:
and
hence is bijective.
2) We prove this item via the following claims:
Claim I. For , with
and
, we have
.
Proof of Claim I. Consider . For , there
exists such that . There exists with
.
Therefore:
Claim II. is one to one.
Proof of Claim II. Consider
with
. Choose , there
exists with , now
we have:
Since for all , we have and is one to one.
Claim III.
For all and we have
if and only if for all .
Proof of Claim III. We have:
Claim IV. is
surjective.
Proof of Claim IV. Choose . For , there exists
with . For
each , choose such that
. Let:
Note that for each and we have and:
(4.6) |
So and don’t depend on the way of choosing s. Moreover, for each , we have (using 4.6 we may suppose ):
th coordinate of
Lemma 4.16.
If , and , then .
Proof.
Theorem 4.18.
We have:
5. Interaction between possible set–theoretical entropies of
In this section, we try to find out the interaction between possible set–theoretical entropies arised from generalized and weighted generalized shifts. In this section, we try once more the above note via two corollaries and then a table.
Corollary 5.1.
Suppose and , then is not finite fibre.
Proof.
Suppose and . By Theorem 3.4, there exist , such that, for each , we have
Let , then for each with , we have:
hence for we have:
(5.1) |
Let , then:
-
•
and ,
-
•
,
-
•
.
Let , then by 5.1 we have:
(5.2) |
i.e., . Therefore:
Since , and are infinite also for each , there exists such that . So , therefore by 5.2, we have , so , therefore , for each and is infinite, hence is not finite fibre which leads to the desired result. ∎
Corollary 5.2.
Suppose is of finite fibre, and , then is not finite fibre.
Proof.
According to Corollaries 5.1 and 5.2, it is not possible to occur the following properties simultaneously (note that if is of finite fibre, then is of finite fibre too):
-
•
is of finite fibre,
-
•
or ,
-
•
.
However, the following example shows that the next conditions are possible to occur simultaneously:
-
•
is of finite fibre,
-
•
,
-
•
.
Example 5.3.
Suppose is infinite. Choose a one to one sequence in . Consider with for and for . Also:
Then is of finite fibre, is not finite fibre, and .
Note 5.4.
If is of finite fibre, as it is clear by the following table, then . However, this may fail to be valid for non–finite fibre by Example 5.3.
A table
Now, let’s use the following predictions for finite field , infinite set , weight vector and self–map :
|
|
Then we have the following table:
![[Uncaptioned image]](https://cdn.awesomepapers.org/papers/feca44e5-9c88-41b6-a628-7325e4d68857/set-theoretic-1.png)
(Table A)
The mark “” indicates that in the corresponding case for all finite fibre we have
“”.
The mark “” indicates that in the corresponding case for all finite fibre we have
“”.
Vertical “” means that one may find proof of corresponding
“” (hence “”) in Step “” below.
Example(s) p, q, …, r, means that in the corresponding case in item(s) p, q, …, r of Counterexample 5.5
one may find finite fibre weighted generalized shifts
such that “” and
“”.
In gray boxes if we substitute the assumption of finite fibreness of
just by finite fibreness of , then the result in the corresponding case in the above table
may fail to be true according to Example 5.3.
Proof of Statements in Table A
Let’s present proof through the following steps and examples:
Step one. It’s clear that for each proposition “” we have “”. Moreover
Step two. We have the following implications for finite fibre :
- i::
- ii::
- iii::
-
“”. If is of finite fibre, then is of finite fibre too, hence by item (ii) we have “”, i.e. “”.
- iv::
-
“”. Use items (i) and (ii).
- v::
-
“”. Use (i) and Step one.
- vi::
-
“”. Use (ii) and Step one.
- vii::
-
“”. Use (iii) and Step one.
- viii::
-
“”. Use (iv) and Step one.
- ix::
- x::
-
“”. Use (ix) and Step one.
- xi::
-
“”. Use Corollary 5.1.
- xii::
-
“”. Use (xi) and Step one.
- xiii::
-
“”. Use Corollary 5.2.
- xiv::
-
“”. Use (xiii) and Step one.
Example 5.5.
Suppose and consider a one to one double sequence in . Consider:
-
•
with:
and:
Then and is of finite fibre.
-
•
with for , , otherwise.
-
•
with and for , also and , otherwise.
Then
-
a.
, however and
-
b.
, also and
-
c.
and
-
d.
6. Set–theoretical entropy of whenever
is invariant
In this section we pay attention to the restriction of to direct sum
is finite.
We try to find out all conditions under which and in the above case we show
where
if and only if there exists
a anti–orbit one to one sequence in .
In this section for each let
and for
also
Lemma 6.1.
The following statements are equivalent:
-
1.
,
-
2.
for each , ,
-
3.
is of finite fibre.
Proof.
(1 2): It is obvious, since is a linear map and
is the linear subspace (of ) generated by .
(2 3): For each we have
hence if and only if is finite, which leads to the desired result. ∎
Convention 6.2.
Henceforth, suppose (or equivalently, by Lemma 6.1, is of finite fibre).
Lemma 6.3.
If and is a one to one sequence, then
-
1.
and ,
-
2.
there exists such that is a one to one sequence,
-
3.
there exists an infinite anti–orbit in .
Proof.
Suppose is a one to one sequence.
1) If , then
for all , which is a contradiction.
Thus and
therefore .
If ,
then , which leads to (by induction on )
thus is an infinite subset of finite set
which is a contradiction, therefore .
2) Suppose has elements.
Then
is an infinite subset of
.
So is infinite too and
there exists such that
is an infinite set.
Suppose for each
either or
is finite, then by the above discussion
and (by item (1)) . So we may suppose , moreover,
is a finite subset of and is the linear subspace generated by , i.e.
.
is a linear space with finite generator over finite field , thus is finite.
Using induction on we prove belongs to .
Note that
For if , then there exists , and such that
then using we have:
which completes the steps of induction.
is an infinite subset of finite set which is a contradiction.
Therefore there exists such that
is infinite, hence
is a one to one sequence.
3) We have the following cases:
Case 1. . Choose inductively in the following way:
by item (1) choose such that is a one to one sequence,
for suppose have been chosen such that
for and
is a one to one sequence.
By item (1) choose such that is a one to one sequence.
Using the above inductive construction, is a anti–orbit sequence in
with . We claim that is a one to one sequence too.
Consider such that , then , which is in contradiction with . Therefore
is a one to one anti–orbit sequence in
.
Case 2. with .
is a one to one sequence so
is a one to one sequence too.
Let and , by Lemma 3.1 we have .
Thus is a one to one sequence. By item (2) there exists
such that
is a one to one sequence.
For each we have hence
. By Case 1 there exists a one to one anti–orbit sequence in
. Let:
i.e., for each and .
Clearly is a anti–orbit sequence with infinite sub–sequence .
Hence is an infinite anti–orbit sequence, therefore it is
a one to one anti–orbit sequence.
Also for each we have , therefore
, hence ,
so for each . Hence
is a one to one anti–orbit sequence in .
∎
Theorem 6.4.
The following statements are equivalent:
-
1.
there exists an infinite anti–orbit in ,
-
2.
,
-
3.
,
-
4.
there exists such that is a one to one sequence.
So:
Proof.
(1 2): Suppose is an infinite anti–orbit in . For let:
For convenience let
Therefore for each we have , in particular
Hence for we have:
We claim that is a collection of pairwise disjoint one to one sequences. For this aim, consider with . By we have:
(6.1) |
thus
(6.2) |
Equations 6.1 and 6.2 lead us to .
Thus is a collection of pairwise disjoint one to one sequences
and .
(2 3): It is obvious.
(3 4): Suppose , thus there exists
such that . There exist
and such that .
Note that is an infinite subset of
So there exists such that
is an infinite set. Therefore
is a one to one sequence.
(4 1) Use Lemma 6.3.
∎
In the following example we show one may choose appropriate and such that , hence .
Example 6.5.
Consider as in Example 2.1, and , then .
7. Contravariant set–theoretical entropy of the finite fibre whenever is invariant
As it has been mentioned in Convention 6.2, in this section we assume (or equivalently, by Lemma 6.1, is of finite fibre). In this section we show is of finite fibre if and only if is of finite fibre and in the above case if and only if there exists a orbit one to one sequence in .
Proposition 7.1.
is of finite fibre if and only if is of finite fibre.
Proof.
Lemma 7.2.
Suppose is of finite fibre, then:
-
1.
,
-
2.
,
-
3.
is of finite fibre,
-
4.
.
Proof.
1) Use Lemma 4.2.
2) ,
i.e., is of finite fibre. Since
, is of finite fibre too. Thus
is of finite fibre. Therefore
is of finite fibre (use ).
By and
Lemma 6.1, .
3) By Proposition 7.1, is of finite fibre.
By Corollary 4.9,
is of finite fibre. By Proposition 7.1, is of finite fibre.
4) Use (1) and a similar proof described in Corollary 4.4.
∎
Lemma 7.3.
Suppose is of finite fibre, then the following statements are equivalent:
1. ,
2. ,
3. there exists a one to one orbit sequence in .
So:
Proof.
(1 2): It is obvious.
(2 3): Suppose
.
By Lemma 7.2(4),
,
hence there exists a
one to one anti–orbit sequence
in .
We may suppose
thus
(for all ).
For let ,
then (using a similar method described in the proof of Lemma 6.3 (1))
for all , , thus
Inductively we show:
(7.1) |
For this aim let and use the following steps:
-
•
Obviously .
-
•
Consider such that . If , then one of the following conditions occur:
-
–
Case 1: . In this case .
-
–
Case 2: . In this case choose such that thus . Therefore .
Using the above cases . Hence .
-
–
Therefore 7.1 is valid. By 7.2(3) the set is finite. So is finite. Suppose
is the linear subspace generated by (). Hence
is an infinite subset of . Therefore there exists such that is infinite,
thus
is infinite, i.e. is infinite
and is a one to one orbit sequence.
In particular is a one to one orbit sequence and
for all , .
The sequence satisfies (3).
(3 1): Suppose is a one to one sequence in .
For consider as 4.3 in the proof of Theorem 4.14. Also, consider
and
surjection
with
().
For each
, we have:
Hence and the following diagram commutes:
By [8, Lemma 3.2.22 (b)] we have:
(7.2) |
Let
Then are pairwise disjoint one to one anti–orbit sequences, thus which completes the proof by 7.2. ∎
Acknowledgement
The authors wish to express their thanks to the anonymous referee for his/her useful guides. Also with thanks to the research division of Farhangian University for the grant which supported this research.
References
- [1] R. Adler, A. Konheim, M. McAndrew, Topological entropy, Trans. AMS 114 (1965) 309–319.
- [2] R. L. Adler, B. Marcus, Topological entropy and equivalence of dynamical systems Mem. Amer. Math. Soc. 20 , no. 219, 1979.
- [3] M. Akhavin, F. Ayatollah Zadeh Shirazi, D. Dikranjan, A. Giordano Bruno, A.,Hosseini, Algebraic entropy of shift endomorphisms on abelian groups, Quaestiones Mathematicae, 32/4 (2009), 529–550.
- [4] F. Ayatollah Zadeh Shirazi, D. Dikranjan, Set theoretical entropy: A tool to compute topological entropy, Proceedings ICTA 2011, Islamabad, Pakistan, July 4-10, 2011 (Cambridge Scientific Publishers), 2012, 11–32.
- [5] F. Ayatollah Zadeh Shirazi, F. Ebrahimifar, R. Rezavand, Weighted generalized shift operators on spaces, Rendiconti del Circolo Matematico di Palermo Series 2, 71/1 (2022), 1–12.
- [6] F. Ayatollah Zadeh Shirazi, N. Karami Kabir, F. Heidari Ardi, A Note on shift theory, Mathematica Pannonica, Proceedings of ITES-2007, 19/2 (2008), 187–195.
- [7] F. Ayatollah Zadeh Shirazi, S. Karimzadeh Dolatabad, S. Shamloo, Interaction between cellularity of alexandroff spaces and entropy of generalized shift maps, Commentationes Mathematicae Universitatis Carolinae, 27/3 (2016), 397–410.
- [8] D. Dikranjan, A, Giordano Bruno, Topological entropy and algebraic entropy for group endomorphisms, Proceedings ICTA 2011, Islamabad, Pakistan, July 4-10, 2011 (Cambridge Scientific Publishers), 2012, 133–214.
- [9] D. Dikranjan, A. Giordano Bruno, L. Salce, Adjoint algebraic entropy, J. Algebra, 324, no. 3 (2010), 442–463.
- [10] D. Dikranjan, B. Goldsmith, L. Salce, P. Zanardo, Algebraic entropy for abelian groups, Trans. Amer. Math. Soc. 361 (2009) 3401–3434.
- [11] D. Dikranjan, A. Giordano Bruno, S. Virili, Strings of group endomorphisms, J. Algebra Appl, 9/6 (2010), 933–958.
- [12] A. Giordano Bruno, Algebraic entropy of shift endomorphisms on products, Comm. Algebra 38 (11) (2010) 4155–4174.
- [13] A. N. Kolmogorov, New metric invariants of transitive dynamical systems and automorphisms of Lebesgue spaces, Doklady Akad. Nauk. SSSR 119 (1958) 861–864.
- [14] Z. Nili Ahmadabadi, F. Ayatollah Zadeh Shirazi, Set–theoretical entropies of generalized shifts, Boletin de Matematicas, 24/2 (2017), 169–183
- [15] D. Ornstein, Bernoulli shifts with the same entropy are isomorphic, Advances in Mathematics, 4 (1970), 337–352.
- [16] D. Ornstein, Two bernoulli shifts with infinite entropy are isomorphic, Advances in Mathematics, 5 (1970-1971), 339–348.
- [17] B. Seward, Bernoulli shifts with bases of equal entropy are isomorphic, Journal of Modern Dynamics, 18 (2022), 345–362.
- [18] P. Shields, The Theory of Bernoulli Shifts Chicago Lectures in Mathematics, The University of Chicago Press, Chicago 1973.
- [19] Y. G. Sinai, On the concept of entropy of a dynamical system, Doklady Akad. Nauk. SSSR 124 (1959) 786–781.
- [20] P. Walters, An introduction to ergodic theory, Graduate Texts in Mathematics, 79. Springer–Verlag, 1982.
- [21] M. D. Weiss, Algebraic and other entropies of group endomorphisms, Math. Systems Theory 8 (3) (1974/75) 243– 248.
Fatemah Ayatollah Zadeh Shirazi, Faculty
of Mathematics, Statistics and Computer Science, College of
Science, University of Tehran, Enghelab Ave., Tehran, Iran
([email protected])
Arezoo Hosseini,
Department of Mathematics Education, Farhangian University,
P. O. Box 14665–889, Tehran, Iran
([email protected])
Lida Mousavi, Department of Mathematics, Yadegar-e-Imam Khomeini (RAH), Shahre
Rey Branch, Islamic Azad University, Tehran, Iran ([email protected])
Reza Rezavand, School of Mathematics, Statistics
and Computer Science, College of Science, University of Tehran,
Enghelab Ave., Tehran, Iran ([email protected])