Operations on Partial Orders

09/27/2018
by   Karl Schlechta, et al.
0

We define analogues of Boolean operations on not necessarily complete partial orders, the height of an element as the maximal length of chains going from BOTTOM to that element, and use height to define probability measures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/06/2021

Partial order alignment by adjacencies and breakpoints

Linearizing two partial orders to maximize the number of adjacencies and...
research
02/20/2023

Ordinal measures of the set of finite multisets

Well-partial orders, and the ordinal invariants used to measure them, ar...
research
02/28/2020

The Complexity of Possible Winners On Partial Chains

The Possible Winner (PW) problem, a fundamental algorithmic problem in c...
research
04/21/2020

Betweenness of partial orders

We construct a monadic second-order sentence that characterizes the tern...
research
07/23/2019

Upper Hessenberg and Toeplitz Bohemians

We look at Bohemians, specifically those with population {-1, 0, +1} and...
research
04/16/2019

Unification and combination of iterative insertion strategies with one-step traversals

Motivated by an ongoing project on the computer aided derivation of mult...
research
07/09/2020

Order-sensitive domination in partially ordered sets

For a (finite) partially ordered set (poset) P, we call a dominating set...

Please sign up or login with your details

Forgot password? Click here to reset