Related papers: The Post Correspondence Problem and equalisers for…

We prove that groups that are mod-p-homology equivalent are isomorphic modulo any term of their derived p-series, in precise analogy to Stallings' 1963 result for the lower-central p-series. Similarly spaces that are mod-p-homology…

We define (iterated) coisotropic correspondences between derived Poisson stacks, and construct symmetric monoidal higher categories of derived Poisson stacks where the $i$-morphisms are given by $i$-fold coisotropic correspondences.…

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

We construct a compact closed category out of any symmetric monoidal category by freely adding adjoints to its objects. The morphisms of the completion are defined as string diagrams annotated by objects and morphisms from the original…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

We establish a formal correspondence between resource calculi an appropriate linear multicategories. We consider the cases of (symmetric) representable, symmetric closed and autonomous multicategories. For all these structures, we prove…

We find a constructive bound for the word length of a generating set for the centralizer of an element of the Mapping Class Group. As a consequence, we show that it is algorithmically decidable whether two postcritically finite branched…

A \emph{morphism} is a mapping that transforms words through letter-wise substitution, where each symbol is consistently replaced by a fixed word. In the field of combinatorics on words, one topic that has attracted considerable attention…

For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…

Sets of solutions to finite systems of equations in a free group, are equivalent to sets of homomorphisms from a fixed f.p. group into a free group. The latter can be encoded in a diagram, the construction of which is valid also for f.g.…

This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…

Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…

Let $\mathsf{mSt}_n$ be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet $\mathcal{A}_n$ by the meet of the stalactic congruence and its dual. In this paper, we prove that $\mathsf{mSt}_n$ can be equipped…

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…

Let $M$ be a topological monoid with homotopy group completion $\Omega BM$. Under a strong homotopy commutativity hypothesis on $M$, we show that $\pi_k (\Omega BM)$ is the quotient of the monoid of free homotopy classes $[S^k, M]$ by its…

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…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

We show that the level sets of automorphisms of free groups with respect to the Lipschitz metric are connected as subsets of Culler-Vogtmann space. In fact we prove our result in a more general setting of deformation spaces. As…

The aim is the theorems of the title and the corollary that the tensor product of two free crossed resolutions of groups or groupoids is also a free crossed resolution of the product group or groupoid. The route to this corollary is through…