Variations on the Post Correspondence Problem for free groups

04/12/2021
by   Laura Ciobanu, et al.
0

The Post Correspondence Problem is a classical decision problem about equalisers of free monoid homomorphisms. We prove connections between several variations of this classical problem, but in the setting of free groups and free group homomorphisms. Among other results, and working under certain injectivity assumptions, we prove that computing the rank of the equaliser of a pair of free group homomorphisms can be applied to computing a basis of this equaliser, and also to solve the "generalised" Post Correspondence Problem for free groups.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2020

The Post Correspondence Problem and equalisers for certain free group and monoid morphisms

A marked free monoid morphism is a morphism for which the image of each ...
research
11/22/2022

Post's correspondence problem for hyperbolic and virtually nilpotent groups

Post's Correspondence Problem (the PCP) is a classical decision problem ...
research
11/08/2021

The Conjugate Post Correspondence Problem

We introduce a modification to the Post Correspondence Problem where (in...
research
01/22/2022

Physical geometry of channel degradation

We outline a geometrical correspondence between capacity and effective f...
research
09/26/2019

The Stroke Correspondence Problem, Revisited

We revisit the stroke correspondence problem [13,14]. We optimize this a...
research
04/20/2003

Whitehead method and Genetic Algorithms

In this paper we discuss a genetic version (GWA) of the Whitehead's algo...
research
04/30/2022

Baba is You is Undecidable

We establish the undecidability of 2019 puzzle game Baba is You through ...

Please sign up or login with your details

Forgot password? Click here to reset