Related papers: Infinite finitely generated automata semigroups ha…

For any finite group Q not of prime power order, we construct a group G that is virtually of type F, contains infinitely many conjugacy classes of subgroups isomorphic to Q, and contains only finitely many conjugacy classes of other finite…

We prove that every finitely generated soluble group which is not virtually abelian has a subgroup of one of a small number of types.

This paper studies automatic structures for subsemigroups of Baumslag--Solitar semigroups (that is, semigroups presented by $\ < x,y \mid (yx^m, x^ny)\ >$, where $m$ and $n$ are natural numbers). A geometric argument (a rarity in the field…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…

In this article we define the semigroup associated to a substitution. We use it to construct a minimal automaton which generates a substitution sequence u in reverse reading. We show, in the case where the substitution has a coincidence,…

We construct the first known examples of infinite subgroups of the outer automorphism group of Out(A_Gamma), for certain right-angled Artin groups A_Gamma. This is achieved by introducing a new class of graphs, called focused graphs, whose…

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

Let $x$, $y$ be two integral quaternions of norm $p$ and $l$, respectively, where $p$, $l$ are distinct odd prime numbers. We investigate the structure of $<x,y>$, the multiplicative group generated by $x$ and $y$. Under a certain condition…

We show that if G is an infinitely generated locally (polycyclic-by-finite) group with cohomology almost everywhere finitary, then every finite subgroup of G acts freely and orthogonally on some sphere.

We show that a finite, connected quiver Q without oriented cycles is a Dynkin or Euclidean quiver if and only if all orbit semigroups of representations of Q are saturated.

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

Let $M$ be a finite von Neumann algebra. In the first part, we give asymptotic results about $M$-stable sequences of weak*-continuous mappings which are related with operators belonging to $M$. In the second part, we extend, by a shorter…

A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…

We make a connection between the subgroup membership and identity problems for matrix groups and extended finite automata. We provide an alternative proof for the decidability of the subgroup membership problem for $ 2 \times 2 $ integer…

Suppose that G is a finitely generated group and W is the formal language of words defining the identity in G. We prove that if G is a nilpotent group, the fundamental group of a finite volume hyperbolic three-manifold, or a right-angled…

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

We prove that a countable semigroup $S$ is locally finite if and only if the Arens-Michael envelope of its semigroup algebra is a $(DF)$-space. This is a counterpart to a recent result of the author, which asserts that $S$ is finitely…

To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.

A semigroup $S$ is called a permutable semigroup if $\alpha \circ \beta =\beta \circ \alpha$ is satified for all congruences $\alpha$ and $\beta$ of $S$. A semigroup is called a Putcha semigroup if it is a semilattice of archimedean…