Finite monogenic distributive systems

From MaRDI portal





For a binary operation \(\cdot\) on \(G\) define \(x_{[k]}\), \(k\geq 1\), by \(x_{[1]}=x\), \(x_{[k+1]}=x_{[k]}\cdot x\). The author considers the situation when \(G\) is finite, the operation \(\cdot\) satisfies the left distributive law \(x\cdot(y\cdot z)=(x\cdot y)\cdot(x\cdot z)\), and \(G=\{x_{[k]};\;k\geq 1\}\). He calls such binary systems left LD-systems. The most prominent examples are the LD-systems \(A_n\) that were invented by R. Laver. The author defines three types of combinatorial operators that make from a left LD-system another left LD-system. Furthermore, he considers the closure of \(A_n\), \(n\geq 0\), under these operators, and conjectures that this closure encompasses all left LD-systems. (The conjecture has been later proved by A. Drápal).











This page was built for publication: Finite monogenic distributive systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4368832)