Related papers: Automatic structures for torus link groups

We show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…

We study the stabilized automorphism group of a subshift of finite type with a certain gluing property called the eventual filling property, on a residually finite group $G$. We show that the stabilized automorphism group is simply…

The notion of free link is a generalized notion of virtual link. In the present paper we define the group of free braids, prove the Alexander theorem that all free links can be obtained as closures of free braids and prove a Markov theorem,…

We prove that asymptotically almost all matroids have a trivial automorphism group, or an automorphism group generated by a single transposition. Additionally, we show that asymptotically almost all sparse paving matroids have a trivial…

We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free…

We associate a root system to a finite set in a free abelian group and prove that its irreducible subsystem is of type A, B or D. We apply this general result to a torus manifold, where a torus manifold is a $2n$-dimensional connected…

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

This thesis has three goals related to the automorphism groups of finite $p$-groups. The primary goal is to provide a complete proof of a theorem showing that, in some asymptotic sense, the automorphism group of almost every finite…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…

Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show…

We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…

Let $\overline G$ be the wonderful compactification of a simple affine algebraic group $G$ defined over $\mathbb C$ such that its center is trivial and $G\not= {\rm PSL}(2,\mathbb{C})$. Take a maximal torus $T \subset G$, and denote by…

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…

Automorphism groups of locally finite trees provide a large class of examples of simple totally disconnected locally compact groups. It is desirable to understand the connections between the global and local structure of such a group.…

We prove a rigidity theorem for the Poisson automorphisms of the function fields of tori with quadratic Poisson structures over fields of characteristic 0. It gives an effective method for classifying the full Poisson automorphism groups of…

The purpose of the present paper is to discuss the following conjecture of Fel'shtyn and Hill, which is a generalization of the classical Burnside theorem: Let G be a countable discrete group, f its automorphism, R(f) the number of…