Interval lengths for interval orders: A minimization problem

DOI10.1016/0012-365X(83)90072-9zbMath0523.06004MaRDI QIDQ1056768

Peter C. Fishburn

Publication date: 1983

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

zbMATH Keywords

interval ordermatrix decompositionfinite partially ordered setinterval lengthL-partitionW-partition

Mathematics Subject Classification ID

Partial orders, general (06A06) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (5)

A combinatorial study of async/await processes ⋮ On \(q\)-series identities related to interval orders ⋮ Counting general and self-dual interval orders ⋮ Asymptotics and statistics on Fishburn matrices and their generalizations ⋮ Interval graphs and interval orders

Cites Work

• Intransitive indifference with unequal indifference intervals
• Description of some relations on the set of real-line intervals
• Semiorders and a Theory of Utility Discrimination
• Foundational aspects of theories of measurement
• Unnamed Item

This page was built for publication: Interval lengths for interval orders: A minimization problem