加载中…
We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and Słomczy{ń}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is polynomially rich if every function preserving congruences and the Tame Congruence Theory labelling of prime quotients in the congruence lattice is a polynomial function of the algebra. We call a finite algebra \emph{strictly polynomially rich} if every partial congruence and type preserving function is a polynomial function, and we describe strictly polynomially rich algebras in congruence permutable varieties.

生成讲解博客的中文版本

生成AI智能校验的中文版本