The linear discrepancy of a poset P is the least k such that there is a linear extension L of P
such that if x and y are incomparable in P, then| h L (x)− h L (y)|≤ k, where h L (x) is the …

Let P be a poset in which each point is incomparable to at most Δ others. Tanenbaum,
Trenk, and Fishburn asked in a 2001 paper if the linear discrepancy of such a poset is …

Forbidden subposets for fractional weak discrepancy at most k - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

In this paper we introduce the notion of the total linear discrepancy of a poset as a way of
measuring the fairness of linear extensions. If L is a linear extension of a poset P, and x, y is …

The linear discrepancy of a poset P is the least k such that there is a linear extension L of P
such that if x and y are incomparable, then| hL (x)− hL (y)|≤ k, whereas the weak …

Linear discrepancy and weak discrepancy have been studied as a measure of fairness in
giving integer ranks to the points of a poset. In linear discrepancy, the points are totally …

A simple poset is a poset whose linear discrepancy increases if any relation of the poset is
removed. In this paper, we investigate more important properties of simple posets such as its …

Let G be an interval graph. The layout that arranges the intervals in order by right endpoint
easily shows that the bandwidth of G is at most its maximum degree∆. Hence, if G contains a …

Linear Discrepancy The linear discrepancy of a partially ordered set (poset) is one way of
measuring the “distance” a poset is from a linear order. Given a poset P and linear extension …

Using ld-irreducible posets, we can easily characterize posets with respect to linear
discrepancy. However, it is difficult to have the list of all the irreducible posets with respect to …