Related papers: Generating infinite monoids of cellular automata

We prove that every finitely presentable group G arises as the fundamental group of an orientable 3-complex obtained from a hyperbolic link complement, by coning each boundary torus of the link exterior to a distinct point. We define the…

Consider the kernel Mag_g of the Magnus representation of the Torelli group and the kernel Bur_n of the Burau representation of the braid group. We prove that for g >= 2 and for n >= 6 the groups Mag_g and Bur_n have infinite rank first…

The nonsoluble length $\lambda(G)$ of a finite group $G$ is defined as the minimum number of nonsoluble factors in a normal series of $G$ each of whose quotients either is soluble or is a direct product of nonabelian simple groups. The…

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

Let $G$ be a finite group. A finite unordered sequence $S = g_1 \boldsymbol{\cdot} \ldots \boldsymbol{\cdot} g_{\ell}$ of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their…

A group $G$ given by a presentation $G = < \mathcal A \| \mathcal R >$ is called weakly finitely presented if every finitely generated subgroup of $G$, generated by (images of) some words in $\mathcal A^{\pm 1}$, is naturally isomorphic to…

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…

We compute the rank of the group of central units in the integral group ring $\Z G$ of a finite strongly monomial group $G$. The formula obtained is in terms of the strong Shoda pairs of $G$. Next we construct a virtual basis of the group…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations. Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily…

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy…

In this paper it is shown how to construct a finite topological space $X$ for a given finitely presentable group $G$ such that $\pi_1(X)\cong G$. Our construction is not optimal in the sense that the cardinality of the space $X$ might not…

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant…

We study subgroups of Thompson's group $F$ by means of an automaton associated with them. We prove that every maximal subgroup of $F$ of infinite index is closed, that is, it coincides with the subgroup of $F$ accepted by the automaton…

We construct finitely generated groups with strong fixed point properties. Let $\mathcal{X}_{ac}$ be the class of Hausdorff spaces of finite covering dimension which are mod-$p$ acyclic for at least one prime $p$. We produce the first…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

A topological group $G$ is topologically normally generated if there exists $g \in G$ such that the normal closure of $g$ is dense in $G$. Let $S$ be a tame, infinite type surface whose mapping class group $\mathrm{Map}(S)$ is generated by…