Equations over the \(k\)-binomial monoids (Q2140471)

Two finite words \(u\) and \(v\) are \(k\)-binomially equivalent if each word of length at most \(k\) appears equally many times in \(u\) and \(v\) as a (scattered) subword. The paper contains several results on the so-called \(k\)-binomial monoid, where \(k\)-binomially equivalent words are identified. First, the author gives straightforward solutions for the commutativity and conjugacy equations in the \(2\)-binomial monoid. Then he proves that for every \(k\), the \(k\)-binomial monoid possesses the compactness property, namely, any system of equations has a finite equivalent subsystem. Moreover, this finite subsystem can be chosen to contain at most \(|\Xi^{\leq k}|\) equations, where \(\Xi\) is the set of variables. For the entire collection see [Zbl 1486.68014].