scholarly journals THE AUTOMORPHISM GROUP OF A SHIFT OF LINEAR GROWTH: BEYOND TRANSITIVITY

2015 ◽  
Vol 3 ◽  
Author(s):  
VAN CYR ◽  
BRYNA KRA
Keyword(s):  
Automorphism Group ◽  
Finite Groups ◽  
Linear Growth ◽  
Finite Alphabet ◽  
Finitely Generated ◽  
Complexity Function ◽  
Algebraic Properties

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 that every finitely generated subgroup of $\text{Aut}(X)$ is virtually $\mathbb{Z}^{d}$, in contrast to the behavior when the complexity function grows more quickly. With additional dynamical assumptions we show more: if $X$ is transitive, then $\text{Aut}(X)$ is virtually $\mathbb{Z}$; if $X$ has dense aperiodic points, then $\text{Aut}(X)$ is virtually $\mathbb{Z}^{d}$. We also classify all finite groups that arise as the automorphism group of a shift.

On the automorphism group of minimal -adic subshifts of finite alphabet rank

2021 ◽  
pp. 1-23
Author(s):  
BASTIÁN ESPINOZA ◽  
ALEJANDRO MAASS
Keyword(s):  
Automorphism Group ◽  
Finite Number ◽  
Linear Growth ◽  
Automorphism Groups ◽  
Low Complexity ◽  
Combinatorial Analysis ◽  
Finite Alphabet

Abstract It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually $\mathbb {Z}$ [Cyr and Kra. The automorphism group of a shift of linear growth: beyond transitivity. Forum Math. Sigma3 (2015), e5; Donoso et al. On automorphism groups of low complexity subshifts. Ergod. Th. & Dynam. Sys.36(1) (2016), 64–95]. In this article we extend this result to a broader class proving that the automorphism group of a minimal $\mathcal {S}$ -adic subshift of finite alphabet rank is virtually $\mathbb {Z}$ . The proof is based on a fine combinatorial analysis of the asymptotic classes in this type of subshifts, which we prove are a finite number.

scholarly journals AN EQUIVARIANT WHITEHEAD ALGORITHM AND CONJUGACY FOR ROOTS OF DEHN TWIST AUTOMORPHISMS

2001 ◽  
Vol 44 (1) ◽  
pp. 117-141 ◽  
Author(s):  
Sava Krstić ◽  
Martin Lustig ◽  
Karen Vogtmann
Keyword(s):  
Free Group ◽  
Finite Groups ◽  
Linear Growth ◽  
Conjugacy Problem ◽  
Dehn Twist ◽  
Subject Classification ◽  
Finitely Generated ◽  
Finite Sets ◽  
Outer Automorphisms ◽  
Secondary 57M07

AbstractGiven finite sets of cyclic words $\{u_1,\dots,u_k\}$ and $\{v_1,\dots,v_k\}$ in a finitely generated free group $F$ and two finite groups $A$ and $B$ of outer automorphisms of $F$, we produce an algorithm to decide whether there is an automorphism which conjugates $A$ to $B$ and takes $u_i$ to $v_i$ for each $i$. If $A$ and $B$ are trivial, this is the classic algorithm due to Whitehead. We use this algorithm together with Cohen and Lustig’s solution to the conjugacy problem for Dehn twist automorphisms of $F$ to solve the conjugacy problem for outer automorphisms which have a power which is a Dehn twist. This settles the conjugacy problem for all automorphisms of $F$ which have linear growth.AMS 2000 Mathematics subject classification: Primary 20F32. Secondary 57M07

scholarly journals Serre’s Property (FA) for automorphism groups of free products

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Naomi Andrew
Keyword(s):  
Automorphism Group ◽  
Free Product ◽  
Finite Groups ◽  
Automorphism Groups ◽  
Sufficient Conditions ◽  
Free Products ◽  
Cyclic Groups ◽  
Link Type ◽  
Open Case

AbstractWe provide some necessary and some sufficient conditions for the automorphism group of a free product of (freely indecomposable, not infinite cyclic) groups to have Property (FA). The additional sufficient conditions are all met by finite groups, and so this case is fully characterised. Therefore, this paper generalises the work of N. Leder [Serre’s Property FA for automorphism groups of free products, preprint (2018), https://arxiv.org/abs/1810.06287v1]. for finite cyclic groups, as well as resolving the open case of that paper.

scholarly journals Some properties of the growth and of the algebraic entropy of group endomorphisms

2017 ◽  
Vol 20 (4) ◽  
Author(s):  
Anna Giordano Bruno ◽  
Pablo Spiga
Keyword(s):  
Finite Groups ◽  
Addition Theorem ◽  
Finitely Generated ◽  
Growth Type ◽  
Locally Finite ◽  
Locally Finite Groups ◽  
Algebraic Entropy ◽  
Finitely Generated Groups ◽  
Identity Automorphism ◽  
Inner Automorphisms

AbstractWe study the growth of group endomorphisms, a generalization of the classical notion of growth of finitely generated groups, which is strictly related to algebraic entropy. We prove that the inner automorphisms of a group have the same growth type and the same algebraic entropy as the identity automorphism. Moreover, we show that endomorphisms of locally finite groups cannot have intermediate growth. We also find an example showing that the Addition Theorem for algebraic entropy does not hold for endomorphisms of arbitrary groups.

scholarly journals Lower central depth in finitely generated soluble-by-finite groups

1978 ◽  
Vol 19 (2) ◽  
pp. 153-154 ◽  
Author(s):  
John C. Lennox
Keyword(s):  
Finite Number ◽  
Nilpotent Group ◽  
Finite Groups ◽  
Soluble Group ◽  
Finite Depth ◽  
Lower Central Series ◽  
Central Series ◽  
Finitely Generated ◽  
Central Depth

We say that a group G has finite lower central depth (or simply, finite depth) if the lower central series of G stabilises after a finite number of steps.In [1], we proved that if G is a finitely generated soluble group in which each two generator subgroup has finite depth then G is a finite-by-nilpotent group. Here, in answer to a question of R. Baer, we prove the following stronger version of this result.

Finitely generated free Heyting algebras

1986 ◽  
Vol 51 (1) ◽  
pp. 152-165 ◽  
Author(s):  
Fabio Bellissima
Keyword(s):  
Free Algebra ◽  
Kripke Semantics ◽  
Heyting Algebras ◽  
Free Algebras ◽  
Finitely Generated ◽  
Algebraic Properties

AbstractThe aim of this paper is to give, using the Kripke semantics for intuitionism, a representation of finitely generated free Heyting algebras. By means of the representation we determine in a constructive way some set of “special elements” of such algebras. Furthermore, we show that many algebraic properties which are satisfied by the free algebra on one generator are not satisfied by free algebras on more than one generator.

scholarly journals Automorphism orbits of finite groups

1986 ◽  
Vol 40 (2) ◽  
pp. 253-260 ◽  
Author(s):  
Thomas J. Laffey ◽  
Desmond MacHale
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Finite Groups ◽  
Prime Power ◽  
Structure Theorem ◽  
Equivalence Classes ◽  
Prime Power Order ◽  
A Finite Group

AbstractLet G be a finite group and let Aut(G) be its automorphism group. Then G is called a k-orbit group if G has k orbits (equivalence classes) under the action of Aut(G). (For g, hG, we have g ~ h if ga = h for some Aut(G).) It is shown that if G is a k-orbit group, then kGp + 1, where p is the least prime dividing the order of G. The 3-orbit groups which are not of prime-power order are classified. It is shown that A5 is the only insoluble 4-orbit group, and a structure theorem is proved about soluble 4-orbit groups.

scholarly journals An uncountable family of finitely generated residually finite groups

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Hip Kuen Chong ◽  
Daniel T. Wise
Keyword(s):  
Free Group ◽  
Finite Groups ◽  
Finitely Generated ◽  
Residually Finite ◽  
Uncountable Family ◽  
Residually Finite Groups ◽  
Rank 2

Abstract We study a family of finitely generated residually finite groups. These groups are doubles F 2 * H F 2 F_{2}*_{H}F_{2} of a rank-2 free group F 2 F_{2} along an infinitely generated subgroup 𝐻. Varying 𝐻 yields uncountably many groups up to isomorphism.

scholarly journals Group Laws Implying Virtual Nilpotence

2003 ◽  
Vol 74 (3) ◽  
pp. 295-312 ◽  
Author(s):  
R. G. Burns ◽  
Yuri Medvedev
Keyword(s):  
Large Class ◽  
Finite Groups ◽  
Additional Condition ◽  
Metabelian Group ◽  
Nilpotency Class ◽  
Finitely Generated ◽  
Finitely Generated Groups ◽  
Locally Graded Groups ◽  
Finite Exponent ◽  
Group Law

AbstractIf ω ≡ 1 is a group law implying virtual nilpotence in every finitely generated metabelian group satisfying it, then it implies virtual nilpotence for the finitely generated groups of a large class of groups including all residually or locally soluble-or-finite groups. In fact the groups of satisfying such a law are all nilpotent-by-finite exponent where the nilpotency class and exponent in question are both bounded above in terms of the length of ω alone. This yields a dichotomy for words. Finally, if the law ω ≡ 1 satisfies a certain additional condition—obtaining in particular for any monoidal or Engel law—then the conclusion extends to the much larger class consisting of all ‘locally graded’ groups.

Conjugacy Separability of Certain Polygonal Products

1996 ◽  
Vol 39 (3) ◽  
pp. 294-307 ◽  
Author(s):  
Goansu Kim
Keyword(s):  
Finite Groups ◽  
Abelian Groups ◽  
Finitely Generated ◽  
Cyclic Subgroups ◽  
Conjugacy Separability ◽  
Conjugacy Separable

AbstractWe show that polygonal products of polycyclic-by-finite groups amalgamating central cyclic subgroups, with trivial intersections, are conjugacy separable. Thus polygonal products of finitely generated abelian groups amalgamating cyclic subgroups, with trivial intersections, are conjugacy separable. As a corollary of this, we obtain that the group A1 *〈a1〉A2 *〈a2〉 • • • *〈am-1〉Am is conjugacy separable for the abelian groups Ai.

Sign in / Sign up

Export Citation Format

Share Document