Notes on the Polish Algorithm
Group Theory
2017-11-28 v1
Abstract
We study, with the help of a computer program, the Polish Algorithm for finite terms satisfying various algebraic laws, e.g., left distributivity a(bc) = (ab)(ac). While the termination of the algorithm for left distributivity remains open in general, we can establish some partial results, which might be useful towards a positive solution. In contrast, we show the divergence of the algorithm for the laws a(bc) = (ab)(cc) and a(bc) = (ab)(a(ac)).
Keywords
Cite
@article{arxiv.1711.09580,
title = {Notes on the Polish Algorithm},
author = {Oliver Deiser},
journal= {arXiv preprint arXiv:1711.09580},
year = {2017}
}