Near-Unanimity Polymorphisms on Structures with Finite Duality

  title={Near-Unanimity Polymorphisms on Structures with Finite Duality},
  author={Cynthia Loten and Claude Tardif},
  journal={SIAM J. Discrete Math.},
We introduce a combinatorial parameter on finite relational trees, called the degree of monstrosity, which measures the smallest possible arity of a near-unanimity polymorphism on a core structure with finite duality. We also show that the core structures which admit all conservative operations as polymorphisms are essentially the structures with finite… CONTINUE READING