The minimal arity of near unanimity polymorphisms-Reference-Cited by-同舟云学术

The minimal arity of near unanimity polymorphisms

Published:2019-03-19 Issue:2 Volume:69 Page:297-310
ISSN:0139-9918
Container-title:Mathematica Slovaca
language:en
Short-container-title:

Author:

Barto Libor¹,Draganov Ondřej¹

Affiliation:

1. Department of Algebra , Faculty of Mathematics and Physics , Charles University , Sokolovská , 83, 18675 Praha 8 , Czech Republic

Abstract

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.

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Link

https://www.degruyter.com/document/doi/10.1515/ms-2017-0223/pdf

Reference12 articles.

1. Barto, L.: Finitely related algebras in congruence distributive varieties have near unanimity terms, Canad. J. Math. 65(1) (2013), 3–21.

2. Barto, L.—Bulín, J.: Deciding absorption in relational structures, Algebra Universalis 78(1) (2017), 3–18.

3. Barto, L.—Kozik, M.: Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem, Log. Methods Comput. Sci. 8(1) (2012).

4. Barto, L.—Krokhin, A.—Willard, R.: Polymorphisms, and how to use them. In: The Constraint Satisfaction Problem: Complexity and Approximability (A. Krokhin, S. Zivny, eds.), Dagstuhl Follow-Ups 7, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2017, pp. 1–44.

5. Bergman, C.: Universal Algebra: Fundamentals and Selected Topics. Pure Appl. Math., Taylor and Francis, 2011.