# Stem and topological entropy on Cayley trees

@article{Ban2021StemAT, title={Stem and topological entropy on Cayley trees}, author={Jung-Chao Ban and Chih-Hung Chang and Yu-Liang Wu and Yu-Ying Wu}, journal={Mathematical Physics, Analysis and Geometry}, year={2021} }

We consider the existence of the topological entropy of shift spaces on a finitely generated semigroup whose Cayley graph is a tree. The considered semigroups include free groups. On the other hand, the notion of stem entropy is introduced. For shift spaces on a strict free semigroup, the stem entropy coincides with the topological entropy. We reveal a sufficient condition for the existence of the stem entropy of shift spaces on a semigroup. Furthermore, we demonstrate that the topological…

## One Citation

Asymptotic pressure on Cayley graphs of finitely generated semigroups

- Mathematics, Physics
- 2021

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction…

## References

SHOWING 1-10 OF 33 REFERENCES

Entropy on regular trees

- Mathematics, Physics
- 2019

We show that the limit in our definition of tree shift topological entropy is actually the infimum, as is the case for both the topological and measure-theoretic entropies in the classical situation…

Complexity of shift spaces on semigroups

- Mathematics, Computer ScienceArXiv
- 2018

The complete characterization of Petersen–Salama entropies of G -SFTs on two symbols is addressed, which extends (Ban and Chang in On the topological entropy of subshifts of finite type on free semigroups, 2018.04394 ) in which G is a free semigroup.

Symbolic dynamics on free groups

- Mathematics
- 2007

We study nearest-neighbor shifts of finite type (NNSOFT) on a free group $\G$. We determine when a NNSOFT on $\G$ admits a periodic coloring and give an example of a NNSOFT that does not allow a…

Tree-Shifts: The entropy of tree-shifts of finite type

- Mathematics
- 2015

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a…

Decidability of Irreducible Tree Shifts of Finite Type

- MathematicsJournal of Statistical Physics
- 2019

We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph…

Cellular Automata and Groups

- Mathematics, Computer ScienceEncyclopedia of Complexity and Systems Science
- 2009

Theorem: Finitely Generated Amenable Groups + Local Embeddability and Sofic Groups + Uniform Structures + Complements of Functional Analysis + Ultrafilters = 6.

Topological properties of cellular automata on trees

- Mathematics, Computer ScienceAUTOMATA & JAC
- 2012

It is proved that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k ≥ 2), and some topological properties of these automata are investigated, namely permutivity, surjectivity, preinj ectivity, right-closingness and openness.

Sofic Tree-Shifts

- Computer Science, MathematicsTheory of Computing Systems
- 2013

It is proved that the Fischer automaton is a topological conjugacy invariant of the underlying irreducible sofic tree-shift, which corresponds to symbolic dynamical systems of infinite ranked trees accepted by finite tree automata.

Tree-Shifts: Irreducibility, mixing, and the chaos of tree-shifts

- Mathematics
- 2015

Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile…