Polynomial interpolation of partial functions in finite algebras with a Mal'cev term
Abstract
We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and Somczy\'nska introduced the completeness concept of being 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 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.