On the number of facets of polytopes representing comparative probability orders

DOI10.1007/S11083-012-9274-0MaRDI QIDQ382891zbMATH OpenOpenAlexWikidataFDO

Authors Ilya Chevyrev, Dominic Searles, Arkadii Slinko

Publication date 22 November 2013

Published in Order (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.3938

zbMATH Keywords

comparative probabilityhyperplane arrangementdiscrete coneflippable pair

Mathematics Subject Classification ID

Partial orders, general (06A06) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52B99)

Abstract: Fine and Gill (1973) introduced the geometric representation for those comparative probability orders on n atoms that have an underlying probability measure. In this representation every such comparative probability order is represented by a region of a certain hyperplane arrangement. Maclagan (1999) asked how many facets a polytope, which is the closure of such a region, might have. We prove that the maximal number of facets is at least F_{n+1}, where F_n is the nth Fibonacci number. We conjecture that this lower bound is sharp. Our proof is combinatorial and makes use of the concept of flippable pairs introduced by Maclagan. We also obtain an upper bound which is not too far from the lower bound.

Recommendations

• Flippable pairs and subset comparisons in comparative probability orderings
• The maximum number of complementary facets of a simplicial polytope
• Geometric and combinatorial properties of the polytope of binary choice probabilities
• scientific article; zbMATH DE number 697092
• Polyhedral aspects of partial orders and comparability graphs

Cites work

• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• scientific article; zbMATH DE number 1228791 (Why is no real title available?)
• scientific article; zbMATH DE number 1357433 (Why is no real title available?)
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• A counterexample to Fishburn's conjecture on finite linear qualitative probability
• Boolean term orders and the root system \(B_n\)
• Finite linear qualitative probability
• Flippable pairs and subset comparisons in comparative probability orderings
• Intuitive Probability on Finite Sets
• Measurement structures and linear inequalities
• Subset Comparisons for Additive Linear Orders
• Sul significato soggettivo della probabilità
• The Magma algebra system. I: The user language
• The enumeration of comparative probability relations

Cited in

(4)

• Mode Poset Probability Polytopes
• Flippable pairs and subset comparisons in comparative probability orderings
• Possibilities determine the combinatorial structure of probability polytopes
• Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures

Describes a project that uses

Uses Software

• Magma

This page was built for publication: On the number of facets of polytopes representing comparative probability orders

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