The minimal arity of near-unanimity polymorphisms
Logic
2017-12-06 v1
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.
Cite
@article{arxiv.1712.01731,
title = {The minimal arity of near-unanimity polymorphisms},
author = {Libor Barto and Ondřej Draganov},
journal= {arXiv preprint arXiv:1712.01731},
year = {2017}
}
Comments
14 pages, submitted to Mathematica Slovaca