The minimal arity of near-unanimity polymorphisms
arXiv:1712.01731 · doi:10.1515/ms-2017-0223
Abstract
Dmitriy Zhuk has proved that there exist relational structures which admit near-unanimity polymorphisms, but the minimum arity of such a polymorphism is large and almost matches the known upper bounds. We present a simplified and explicit construction of such structures and a detailed, self-contained proof.
14 pages, submitted to Mathematica Slovaca