Related papers: Automaton groups and complete square complexes
The complex algebra of an inverse semigroup with finitely many idempotents in each $\mathcal D$-class is stably finite by a result of Munn. This can be proved fairly easily using $C^*$-algebras for inverse semigroups satisfying this…
The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…
For any choice of a basis $\cal A$ the free group $F_N$ of finite rank $N \geq 2$ can be canonically identified with the set $F(\cal A)$ of reduced words in $\cal A\cup \cal A^{-1}$. However, such a word $w \in F(\cal A)$ admits a second…
On this paper we will present a construction of a CAT(0) cube complex (an infinite cube), on which the uncountable family of Grigorchuk groups $G_\omega$ act without bounded orbit. Moreover, if the sequence $\omega$ does not contain…
In 1960 Fuchs posed the problem of characterizing the groups which are the groups of units of commutative rings. In the following years, some partial answers have been given to this question in particular cases. In this paper we address…
Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…
We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…
For group actions on hyperbolic CAT(0) square complexes, we show that the acylindricity of the action is equivalent to a weaker form of acylindricity phrased purely in terms of stabilisers of points, which has the advantage of being much…
We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…
We prove that the boundary dynamics of the (semi)group generated by the enriched dual transducer characterizes the algebraic property of being free for an automaton group. We specialize this result to the class of bireversible transducers…
This paper describes the structure of invariant skew fields for linear actions of finite solvable groups on free skew fields in $d$ generators. These invariant skew fields are always finitely generated, which contrasts with the free algebra…
We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary…
The surface Houghton groups $\mathcal{H}_{n}$ are a family of groups generalizing Houghton groups $H_n$, which are constructed as asymptotically rigid mapping class groups. We give a complete computation of the BNSR-invariants…
We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…
A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…
We give an infinite family of torsion-free groups that do not satisfy the unique product property. For these examples, we also show that each group contains arbitrarily large sets whose square has no uniquely represented element.
Let $\mathcal{T}$ denote the class of finitely generated torsion-free nilpotent groups. For a group $G$ let $F(G)$ be the set of isomorphism classes of finite quotients of $G$. Pickel proved that if $G \in \mathcal{T}$, then the set…
In this article, we study the elements with disconnected centralizer in the Brauer complex associated to a simple algebraic group G defined over a finite field with corresponding Frobenius map F and derive the number of F-stable semisimple…
We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…
In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…