NU polymorphisms on reflexive digraphs

Benoit Larose; Mark Siggers

doi:10.1137/16M110527X

NU polymorphisms on reflexive digraphs

Benoit Larose, Mark Siggers

Université du Québec à Montréal

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	728-749
Number of pages	22
Journal	SIAM Journal on Discrete Mathematics
Volume	32
Issue number	1
DOIs	https://doi.org/10.1137/16M110527X
State	Published - 2018

Keywords

Near-unanimity polymorphism
Posets
Reflexive digraphs

Access to Document

10.1137/16M110527X

Cite this

@article{ff4d5fa4578b489ba932f3c5ff94ef5d,

title = "NU polymorphisms on reflexive digraphs",

abstract = "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.",

keywords = "Near-unanimity polymorphism, Posets, Reflexive digraphs",

author = "Benoit Larose and Mark Siggers",

note = "Publisher Copyright: {\textcopyright} 2018 Society for Industrial and Applied Mathematics.",

year = "2018",

doi = "10.1137/16M110527X",

language = "English",

volume = "32",

pages = "728--749",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "1",

}

TY - JOUR

T1 - NU polymorphisms on reflexive digraphs

AU - Larose, Benoit

AU - Siggers, Mark

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

KW - Near-unanimity polymorphism

KW - Posets

KW - Reflexive digraphs

UR - http://www.scopus.com/inward/record.url?scp=85045626873&partnerID=8YFLogxK

U2 - 10.1137/16M110527X

DO - 10.1137/16M110527X

M3 - Article

AN - SCOPUS:85045626873

SN - 0895-4801

VL - 32

SP - 728

EP - 749

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 1

ER -

NU polymorphisms on reflexive digraphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this