Related papers: Groups with ET0L co-word problem
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…
This paper studies decision problems for semigroups that are word-hyperbolic in the sense of Duncan & Gilman. A fundamental investigation reveals that the natural definition of a `word-hyperbolic structure' has to be strengthened slightly…
Using ideas from 3-manifolds, Hatcher--Wahl defined a notion of automorphism groups of free groups with boundary. We study their Torelli subgroups, adapting ideas introduced by Putman for surface mapping class groups. Our main results show…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…
Let $w$ be a group-word. Suppose that the set of all $w$-values in a profinite group $G$ is contained in a union of countably many subgroups. It is natural to ask in what way the structure of the verbal subgroup $w(G)$ depends on the…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…
We find a finite free resolution of the counit of the free unitary quantum groups of van Daele and Wang and, more generally, Bichon's universal cosovereign Hopf algebras with a generic parameter matrix. This allows us to compute Hochschild…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
We study K-theory classes of Hamiltonian loop group spaces represented by admissible Fredholm complexes. We prove various equivariant index formulae in this context. In a sequel to this article we show that, when specialized to a family of…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…
We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…
We are interested in the subgroup membership problem in groups acting on rooted $d$-regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite…
We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.
The class of evolving groups is defined and investigated, as well as their connections to examples in the field of Galois cohomology. Evolving groups are proved to be Sylow Tower groups in a rather strong sense. In addition, evolving groups…