Abstract. We discuss bijections that relate families of chains in lattices associated to an order P and families of interval orders dened on the ground set of P. Two bijections of this type have been known: (1) The bijection between maximal chains in the antichain lattice A(P) and the linear extensions of P. (2) A bijection between maximal chains in the lattice of maximal antichains A M (P) and minimal interval extensions of P. We discuss two approaches to associate interval orders to chains in A(P). This leads to new bijections generalizing Bijections 1 and 2. As a consequence we char-acterize the chains corresponding to weak-order extensions and minimal weak-order extensions of P. Seeking for a way of representing interval reductions of P...
AbstractWe define a new poset on the symmetric group Sn. It is subposet of the weak ordering of Sn w...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
Given a partial order Q, its semiorder dimension is the smallest number of semiorders whose intersec...
Article dans revue scientifique avec comité de lecture.We discuss bijections that relate families of...
AbstractIn general, an interval order is defined to be an ordered set which has an interval represen...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
To make a decision, we need to compare the values of quantities. In many practical situations, we kn...
AbstractIn Part I of this paper, we introduced a method of making two isomorphic intervals of a boun...
AbstractOne definition of an interval order is as an order isomorphic to that of a family of nontriv...
AbstractThe main results of this paper are two distinct characterizations of interval orders and an ...
AbstractThis paper explores the intimate connection between finite interval graphs and interval orde...
We introduce a partial order structure on the set of interval orders of a given size, and prove that...
AbstractSemi-orders form a subclass of interval orders: they can be represented as sets of intervals...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
AbstractWe define a new poset on the symmetric group Sn. It is subposet of the weak ordering of Sn w...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
Given a partial order Q, its semiorder dimension is the smallest number of semiorders whose intersec...
Article dans revue scientifique avec comité de lecture.We discuss bijections that relate families of...
AbstractIn general, an interval order is defined to be an ordered set which has an interval represen...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
To make a decision, we need to compare the values of quantities. In many practical situations, we kn...
AbstractIn Part I of this paper, we introduced a method of making two isomorphic intervals of a boun...
AbstractOne definition of an interval order is as an order isomorphic to that of a family of nontriv...
AbstractThe main results of this paper are two distinct characterizations of interval orders and an ...
AbstractThis paper explores the intimate connection between finite interval graphs and interval orde...
We introduce a partial order structure on the set of interval orders of a given size, and prove that...
AbstractSemi-orders form a subclass of interval orders: they can be represented as sets of intervals...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
AbstractWe define a new poset on the symmetric group Sn. It is subposet of the weak ordering of Sn w...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
Given a partial order Q, its semiorder dimension is the smallest number of semiorders whose intersec...