Interval lengths for interval orders: A minimization problem

DOI10.1016/0012-365X(83)90072-9MaRDI QIDQ1056768zbMATH OpenFDO

Authors Peter Fishburn

Publication date 1983

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(83)90072-9

zbMATH Keywords

finite partially ordered setinterval lengthinterval orderL-partitionmatrix decompositionW-partition

Mathematics Subject Classification ID

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

Cites work

• Description of some relations on the set of real-line intervals
• Foundational aspects of theories of measurement
• scientific article; zbMATH DE number 3857173 (Why is no real title available?)
• Intransitive indifference with unequal indifference intervals
• Semiorders and a Theory of Utility Discrimination

Cited in

(6)

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

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

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