Related papers: Automatic structures for torus link groups

In this note, we define the Burnside ring of a monoid, generalizing the construction for groups. After giving foundational definitions, we characterize transitive M-sets and their automorphisms, then prove a structure theorem for a broad…

We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…

The partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup $S$ with no isolated nontrivial…

A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific…

We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.

We prove that Coxeter groups are biautomatic. From our construction of the biautomatic structure it follows that uniform lattices in isometry groups of buildings are biautomatic.

Automatic groups admitting prefix closed automatic structures with uniqueness are characterized as the quotients of free groups by normal subgroups possessing sets of free generators satisfying certain language-theoretic conditions.

Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This…

We construct a quasi-Garside monoid structure for the free group. This monoid should be thought of as a dual braid monoid for the free group, generalising the constructions by Birman-Ko-Lee and by the author of new Garside monoids for Artin…

We study locally closed transformation monoids which contain the automorphism group of the random graph. We show that such a transformation monoid is locally generated by the permutations in the monoid, or contains a constant operation, or…

Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.

In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff…

We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain…

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

We prove an automatic convergence theorem for holomorphic modular forms on tube domains. The argument works in some generality, and covers in particular the case of orthogonal groups, symplectic groups, unitary and quaternion unitary…

We prove that an Artin-Tits group of type $\tilde C$ is the group of fractions of a Garside monoid, analogous to the known dual monoids associated with Artin-Tits groups of spherical type and obtained by the "generated group" method. This…

In this paper, we establish a rigidity result for automorphisms of multiplicative direct products of $D$-rings which are total ring of fraction that have pairwise distinct cardinalities. Under these assumptions, every automorphism acts…

Let G be a totally disconnected, locally compact group admitting a contractive automorphism f. We prove a Jordan-Holder theorem for series of f-stable closed subgroups of G, classify all possible composition factors and deduce consequences…

Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…

We improve and shorten the argument given in(Journal of Algebra, vol.~210 (1998) pp~291--297). Inparticular, the fact that Artin braid groups are torsion free now follows from Garside\'s results almost immediately.