A Characterization of Partially Ordered Sets with Linear Discrepancy Equal to 2
- 30 Downloads
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 height of x in L. Tanenbaum, Trenk, and Fishburn characterized the posets of linear discrepancy 1 as the semiorders of width 2 and posed the problem of characterizing the posets of linear discrepancy 2. We show that this problem is equivalent to finding the posets with linear discrepancy equal to 3 having the property that the deletion of any point results in a reduction in the linear discrepancy. Howard determined that there are infinitely many such posets of width 2. We complete the forbidden subposet characterization of posets with linear discrepancy equal to 2 by finding the minimal posets of width 3 with linear discrepancy equal to 3. We do so by showing that, with a small number of exceptions, they can all be derived from the list for width 2 by the removal of specific comparisons.
KeywordsPoset Linear discrepancy Linear extension
Mathematics Subject Classification (2000)06A07
Unable to display preview. Download preview PDF.
- 3.Howard, D.M.: 3-Discrepancy-irreducible posets of width 2 (2007) (Preliminary Manuscript)Google Scholar
- 6.Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD (1992)Google Scholar