Each complexity-two word represents every sufficiently long spike. (Q1771874)

Denote by \(k=\{0,1,\dots,k-1\}\) and by \(\text{Prt}(k)\) the composition monoid of all partial functions \(f\subseteq k\times k\). Let \(r_k\) denote the partial function \(\{\langle i,i+1\rangle;\;i=0,\dots,k-2\}\). For \(m,n\) positive integers the authors study the set \(S(m,n)\) of all integers \(k\geq 2\) such that there exists no \(\langle x,y\rangle\in\text{Prt}(k)\times\text{Prt}(k)\) which satisfies \(r_k=x^m\cdot y^n\). It is proved that: (i) Whenever \(m\cdot n\) is odd then \(S(m,n)=\emptyset\). (ii) \(S(m,n)\) is finite and \(S(m,n)=S(n,m)\).