Monomial clones over \(\mathbb {F}_q\) (Q2418562)

Let \(\mathbb {F}_q\) denote the finite field of \(q\) elements. A clone in \(\mathbb {F}_q\) is a set of polynomials over \(\mathbb {F}_q\) (in any number of variables) containing all projections and closed under composition. The authors present a description of all clones in \(F_q\) generated by a single idempotent monomial \(x^ay^{q-a}\), solving a problem posed by \textit{H. Machida} and \textit{J. Pantović} [``Three classes of closed sets of monomials'', in: Proceedings of the 47th IEEE international symposium on multiple-valued logic, ISMVL 2017, Novi Sad, Serbia, May 22--24, 2017. Los Alamitos, CA: IEEE Computer Society. 100--105 (2017)]. They observe first that the problem can be reduced to the question of description of \(\langle u\rangle\), the smallest set containing a given number \(u\in\{1,2,\dots,q\}\) and closed under the operations \[\Phi(a,b,s)=as+b(1-s)\bmod{(q-1)}, \quad\Psi(a)=1-a\bmod{(q-1)}\] and answer it by establishing the following Theorem 2.4: \medskip If \(1\le u\le q\), then \(\langle u\rangle = H_{d_1}\cap H_{d_2}\), where \(d_1=(u,q-1)\), \(d_2=(1-u,q-1)\) and for \(d| q-1\) one has \[H_d=\{a\bmod q:\ a\equiv0\bmod{d}\ \text{ or }\ a\equiv1\bmod{d}\}.\] The authors point out that in the proof of this result one does not have to assume that \(q\) is a prime power.