Remnant inequalities and doubly-twisted conjugacy in free groups
P. Christopher Staecker

TL;DR
This paper introduces new criteria and algorithms for determining doubly-twisted conjugacy in free groups, showing that such conjugacy is rare under certain conditions and analyzing the density of homomorphisms.
Contribution
It provides a remnant inequality condition for non-conjugacy, an algorithm for deciding conjugacy, and analyzes the density of homomorphisms in free groups.
Findings
Probability that two words are not doubly-twisted conjugate is 1 under certain conditions.
Algorithm can decide conjugacy relations when remnant conditions are met.
Computed densities and expected values of homomorphisms in free groups.
Abstract
We give two results for computing doubly-twisted conjugacy relations in free groups with respect to homomorphisms and such that certain remnant words from are longer than the images of generators under . Our first result is a remnant inequality condition which implies that two words and are not doubly-twisted conjugate. Further we show that if is given and , , and are chosen at random, then the probability that and are not doubly-twisted conjugate is 1. In the particular case of singly-twisted conjugacy, this means that if , , and are chosen at random, then and are not in the same singly-twisted conjugacy class with probability 1. Our second result generalizes Kim's "bounded solution length". We give an algorithm for deciding doubly-twisted conjugacy relations in the case where and …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
