Related papers: Automatic Quotients of Free Groups

We present a contribution to the structure theory of locally compact groups. The emphasis is on compactly generated locally compact groups which admit no infinite discrete quotient. It is shown that such a group possesses a characteristic…

We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.

A group $G$ is said to be a $C$-group if every subgroup $H$ has a permutable complement, i.e. if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H \cap K=1$. In this paper, we study the profinite counterpart of this concept. We say…

Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

Given an action of an affine algebraic group with only trivial characters on a factorial variety, we ask for categorical quotients. We characterize existence in the category of algebraic varieties. Moreover, allowing constructible sets as…

We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are…

The history, definition and principal properties of automatic groups and their generalisations to subgroups and cosets are reviewed briefly, mainly from a computational perspective. A result about the asynchronous automaticity of an HNN…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We prove that the set of orders of finite quotients of a finitely generated group has natural density 0, 1/2 or 1, and characterise when each of these cases occurs. We apply this to show that the sets of orders of various families of…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

The automorphisms of free groups with boundaries form a family of groups A_{n,k} closely related to mapping class groups, with the standard automorphisms of free groups as A_{n,0} and (essentially) the symmetric automorphisms of free groups…

Let k be an algebraically closed field of characteristic zero, F its algebraically closed extension, and G be the group of k-automorphisms of F endowed with a natural topology. One of the purposes of this paper is to show that any…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

The concept of gyrogroups, with a weaker algebraic structure without associative law, was introduced under the background of $c$-ball of relativistically admissible velocities with Einstein velocity addition. A topological gyrogroup is just…

We provide a systematic description of the automorphism groups of specially cocompact CAT(0) cube complexes. We show that these groups are topologically finitely generated, present a method to explicitly obtain generating sets, and prove a…

Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…

We introduce the new notion of quotient-saturation as a measure of the immensity of the quotient structure of a group. We present a sufficient condition for a finitely presented group to be quotient-saturated, and use it to deduce that…