10,947 research outputs found
Primary Facets Of Order Polytopes
Mixture models on order relations play a central role in recent
investigations of transitivity in binary choice data. In such a model, the
vectors of choice probabilities are the convex combinations of the
characteristic vectors of all order relations of a chosen type. The five
prominent types of order relations are linear orders, weak orders, semiorders,
interval orders and partial orders. For each of them, the problem of finding a
complete, workable characterization of the vectors of probabilities is
crucial---but it is reputably inaccessible. Under a geometric reformulation,
the problem asks for a linear description of a convex polytope whose vertices
are known. As for any convex polytope, a shortest linear description comprises
one linear inequality per facet. Getting all of the facet-defining inequalities
of any of the five order polytopes seems presently out of reach. Here we search
for the facet-defining inequalities which we call primary because their
coefficients take only the values -1, 0 or 1. We provide a classification of
all primary, facet-defining inequalities of three of the five order polytopes.
Moreover, we elaborate on the intricacy of the primary facet-defining
inequalities of the linear order and the weak order polytopes
A convenient category of locally preordered spaces
As a practical foundation for a homotopy theory of abstract spacetime, we
extend a category of certain compact partially ordered spaces to a convenient
category of locally preordered spaces. In particular, we show that our new
category is Cartesian closed and that the forgetful functor to the category of
compactly generated spaces creates all limits and colimits.Comment: 26 pages, 0 figures, partially presented at GETCO 2005; changes:
claim of Prop. 5.11 weakened to finite case and proof changed due to problems
with proof of Lemma 3.26, now removed; Eg. 2.7, statement before Lem. 2.11,
typos, and other minor problems corrected throughout; extensive rewording;
proof of Lem. 3.31, now 3.30, adde
On the weak order of Coxeter groups
This paper provides some evidence for conjectural relations between
extensions of (right) weak order on Coxeter groups, closure operators on root
systems, and Bruhat order. The conjecture focused upon here refines an earlier
question as to whether the set of initial sections of reflection orders,
ordered by inclusion, forms a complete lattice. Meet and join in weak order are
described in terms of a suitable closure operator. Galois connections are
defined from the power set of W to itself, under which maximal subgroups of
certain groupoids correspond to certain complete meet subsemilattices of weak
order. An analogue of weak order for standard parabolic subsets of any rank of
the root system is defined, reducing to the usual weak order in rank zero, and
having some analogous properties in rank one (and conjecturally in general).Comment: 37 pages, submitte
EXTENDED PARTIAL ORDERS: A UNIFYING STRUCTURE FOR ABSTRACT CHOICE THEORY
The concept of a strict extended partial order (SEPO) has turned out to be very useful in explaining (resp. rationalizing) non-binary choice functions. The present paper provides a general account of the concept of extended binary relations, i.e., relations between subsets and elements of a given universal set of alternatives. In particular, we define the concept of a weak extended partial order (WEPO) and show how it can be used in order to represent rankings of opportunity sets that display a ""preference for opportunities."" We also clarify the relationship between SEPOs and WEPOs, which involves a non-trivial condition, called ""strict properness."" Several characterizations of strict (and weak) properness are provided based on which we argue for properness as an appropriate condition demarcating ""choice based"" preference.
- …