Synthetic description of a semiorder

DOI10.1016/0166-218X(91)90057-4MaRDI QIDQ1175797zbMATH OpenWikidataFDO

Authors Marc Pirlot

Publication date 25 June 1992

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(91)90057-4

zbMATH Keywords

hollowsincidence step matrixnosespreference modellingsemiordersynthetic description

Mathematics Subject Classification ID

Ordered sets (06A99) Group preferences (91B10)

Review text

In an earlier study of minimal representations of semiorders, the author introduced a substructure of ``noses and ``hollows essentially describing the frontier between 0's and 1's in the incidence step matrix of a semiorder. In this paper, he shows that the ``noses and ``hollows provide a synthetic description of a semiorder that they determine completely. These results have computational implications since the amount of information used in the synthetic description is of the order of the cardinal of the set on which the semiorder is defined.

Recommendations

• Minimal representation of a semiorder
• The representation polyhedron of a semiorder.
• scientific article; zbMATH DE number 4055680
• Numerical representability of semiorders
• Threshold Representations of Multiple Semiorders

Cites work

• Betweenness, orders and interval graphs
• Biorder families, valued relations, and preference modelling
• scientific article; zbMATH DE number 4064702 (Why is no real title available?)
• scientific article; zbMATH DE number 3641510 (Why is no real title available?)
• scientific article; zbMATH DE number 3249566 (Why is no real title available?)
• scientific article; zbMATH DE number 3378735 (Why is no real title available?)
• Minimal representation of a semiorder
• Threshold Representations of Multiple Semiorders
• Threshold-Bounded Interval Orders and a Theory of Picycles

Cited in

(15)

• Scott-suppes representability of semiorders: Internal conditions
• Well-graded families of relations
• On properties of unit interval graphs with a perceptual motivation
• Simple and simplest semi-orders
• Numerical representability of semiorders
• Any complete preference structure without circuit admits an interval representation
• The representation polyhedron of a semiorder.
• Unit representation of semiorders. I: Countable sets
• Unit representation of semiorders. II: The general case
• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory
• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. II: Algorithms
• Rectangles, Fringes, and Inverses
• A Note on Candeal and Induráin’s Semiorder Separability Condition
• The length polyhedron of an interval order
• Continuous representability of semiorders

This page was built for publication: Synthetic description of a semiorder

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175797)