Weak-Order Extensions of an Order
dc.contributor.author | Bertet, Karell | |
dc.contributor.author | Gustedt, Jens | |
dc.contributor.author | Morvan, Michel | |
dc.date.accessioned | 2021-12-17T10:08:36Z | |
dc.date.available | 2021-12-17T10:08:36Z | |
dc.date.issued | 1997 | |
dc.description.abstract | In this paper, at first we describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. Finally, we prove that the number of weak-order extensions of a partially ordered set is a comparability invariant, whereas the number of minimal weak-order extensions of a partially ordered set is not a comparability invariant. | en |
dc.identifier.issn | 2197-8085 | |
dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15672 | |
dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14445 | |
dc.language.iso | en | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.ddc | 510 Mathematik | en |
dc.subject.other | order | en |
dc.subject.other | weak-order extensions | en |
dc.subject.other | graph | en |
dc.subject.other | algorithm | en |
dc.title | Weak-Order Extensions of an Order | en |
dc.type | Research Paper | en |
dc.type.version | submittedVersion | en |
tub.accessrights.dnb | free | en |
tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
tub.affiliation.institute | Inst. Mathematik | de |
tub.publisher.universityorinstitution | Technische Universität Berlin | en |
tub.series.issuenumber | 1997, 550 | en |
tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |