NU Polymorphisms on Reflexive Digraphs.

SIAM JOURNAL ON DISCRETE MATHEMATICS(2018)

引用 0|浏览20
暂无评分
摘要
We find a set of generators of the variety of reflexive digraphs admitting k - NU polymorphisms. We do this, in spite of the fact that such digraphs do not have finite tree duality, by defining finite duals of infinite trees. As a result of this, we answer a question of Quackenbush, Rival, and Rosenberg, giving a finite family of generators of the variety of finite bounded posets admitting k - NU polymorphisms.
更多
查看译文
关键词
near-unanimity polymorphism,reflexive digraphs,posets
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要