Finite algebras of finite complexity (Q1817568)

Let \(L\), \(R\) be symmetric relations of an algebra \(A\), \(\delta \in\text{Con} A\), \(t\) be an arbitrary polynomial and \(a, b, c, d\) be vectors of elements of \(A\). \(L\) rectangulates \(R\) modulo \(\delta\), in symbols \({\mathcal R} (L,R,\delta)\), if \(aLb\), \(cRd\) and \(t(a,c)\delta t(b,d)\) imply that all \(t(a,c)\), \(t(a,d)\), \(t(b,c)\), \(t(b,d)\) are \(\delta\)-related. An algebra \(A\) is rectangular if \({\mathcal R}(1_A,1_A,0_A)\) holds, where \(0_A\) and \(1_A\) denote the least and the greatest congruence of \(A\), respectively. An algebra \(A\) has finite complexity if every of its terms is equivalent to one whose composition tree has depth less than an integer \(N\). Main results: Theorem 4.4. For a finite algebra \(A\), the following are equivalent: (1) \(A\) has finite essential complexity; (2) \(A\) is of locally finite essential arity; (3) \(A\) is strongly nilpotent. Theorem 5.3. Let \(A\) be a rectangular algebra. Then each term operation of \(A\) depends on fewer then \(|A|\) variables. It is proved that a locally finite locally strongly nilpotent variety is residually small iff it is rectangular. Hence, a locally finite rectangular variety is residually small. This yields an algorithm deciding whether a finite strongly nilpotent algebra in a finite language generates a residually small variety.