scholarly journals FINITELY CONSTRAINED GROUPS OF MAXIMAL HAUSDORFF DIMENSION

2015 ◽  
Vol 100 (1) ◽  
pp. 108-123 ◽  
Author(s):  
ANDREW PENLAND ◽  
ZORAN ŠUNIĆ

We prove that if $G_{P}$ is a finitely constrained group of binary rooted tree automorphisms (a group binary tree subshift of finite type) defined by an essential pattern group $P$ of pattern size $d$, $d\geq 2$, and if $G_{P}$ has maximal Hausdorff dimension (equal to $1-1/2^{d-1}$), then $G_{P}$ is not topologically finitely generated. We describe precisely all essential pattern groups $P$ that yield finitely constrained groups with maximal Hausdorff dimension. For a given size $d$, $d\geq 2$, there are exactly $2^{d-1}$ such pattern groups and they are all maximal in the group of automorphisms of the finite rooted regular tree of depth $d$.

2018 ◽  
Vol 39 (12) ◽  
pp. 3185-3206
Author(s):  
SEBASTIÁN BARBIERI ◽  
MATHIEU SABLIK

We generalize a result of Hochman in two simultaneous directions: instead of realizing an arbitrary effectively closed $\mathbb{Z}^{d}$ action as a factor of a subaction of a $\mathbb{Z}^{d+2}$-SFT we realize an action of a finitely generated group analogously in any semidirect product of the group with $\mathbb{Z}^{2}$. Let $H$ be a finitely generated group and $G=\mathbb{Z}^{2}\rtimes _{\unicode[STIX]{x1D711}}H$ a semidirect product. We show that for any effectively closed $H$-dynamical system $(Y,T)$ where $Y\subset \{0,1\}^{\mathbb{N}}$, there exists a $G$-subshift of finite type $(X,\unicode[STIX]{x1D70E})$ such that the $H$-subaction of $(X,\unicode[STIX]{x1D70E})$ is an extension of $(Y,T)$. In the case where $T$ is an expansive action, a subshift conjugated to $(Y,T)$ can be obtained as the $H$-projective subdynamics of a sofic $G$-subshift. As a corollary, we obtain that $G$ admits a non-empty strongly aperiodic subshift of finite type whenever the word problem of $H$ is decidable.


2013 ◽  
Vol 23 (01) ◽  
pp. 69-79 ◽  
Author(s):  
IEVGEN V. BONDARENKO ◽  
IGOR O. SAMOILOVYCH

A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a self-similar group of finite type is finite, level-transitive, or topologically finitely generated. Using these criteria and GAP computations we show that for the binary alphabet there is no infinite topologically finitely generated self-similar group given by patterns of depth 3, and there are 32 such groups for depth 4.


2020 ◽  
pp. 1-12 ◽  
Author(s):  
ADRIEN LE BOUDEC

We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of finitely generated simple groups quasi-isometric to a wreath product $C\wr F$ , where $C$ is a finite group and $F$ a non-abelian free group.


2002 ◽  
Vol 02 (04) ◽  
pp. 599-607 ◽  
Author(s):  
VÍCTOR F. SIRVENT

We compute the spectra of the recurrence dimension for adic systems and sub-adic systems. This dimension is characterized by the Poincaré recurrence of the system, and known in the literature as Afraimovich–Pesin dimension. These spectra are invariant under bi-Lipschitz transformations. We show that there is a duality between the spectra of an adic system and the corresponding subshift of finite type. We also consider Billingsley-like definition of the spectra of the recurrence dimension.


2008 ◽  
Vol 28 (4) ◽  
pp. 1135-1143 ◽  
Author(s):  
KAMEL HADDAD ◽  
WILLIAM OTT

AbstractWe introduce and study the notion of weak product recurrence. Two sufficient conditions for this type of recurrence are established. We deduce that any point with a dense orbit in either the full one-sided shift on a finite number of symbols or a mixing subshift of finite type is weakly product recurrent. This observation implies that distality does not follow from weak product recurrence. We have therefore answered, in the negative, a question posed by Auslander and Furstenberg.


1998 ◽  
Vol 18 (5) ◽  
pp. 1097-1114 ◽  
Author(s):  
DMITRY DOLGOPYAT

We provide necessary and sufficient conditions for a suspension flow, over a subshift of finite type, to mix faster than any power of time. Then we show that these conditions are satisfied if the flow has two periodic orbits such that the ratio of the periods cannot be well approximated by rationals.


1997 ◽  
Vol 17 (2) ◽  
pp. 417-433 ◽  
Author(s):  
PETR KŮRKA

We consider three related classifications of cellular automata: the first is based on the complexity of languages generated by clopen partitions of the state space, i.e. on the complexity of the factor subshifts; the second is based on the concept of equicontinuity and it is a modification of the classification introduced by Gilman [9]. The third one is based on the concept of attractors and it refines the classification introduced by Hurley [16]. We show relations between these classifications and give examples of cellular automata in the intersection classes. In particular, we show that every positively expansive cellular automaton is conjugate to a one-sided subshift of finite type and that every topologically transitive cellular automaton is sensitive to initial conditions. We also construct a cellular automaton with minimal quasi-attractor, whose basin has measure zero, answering a question raised in Hurley [16].


2017 ◽  
Vol 98 ◽  
pp. 1-6 ◽  
Author(s):  
Hyonhui Ju ◽  
Cholsan Kim ◽  
Yunmi Choe ◽  
Minghao Chen

Sign in / Sign up

Export Citation Format

Share Document