Title:
Some results on linear discrepancy for partially ordered sets

Simple item page
dc.contributor.advisor Trotter, William T.
dc.contributor.author Keller, Mitchel Todd en_US
dc.contributor.committeeMember Dieci, Luca
dc.contributor.committeeMember Mihail, Milena
dc.contributor.committeeMember Tetali, Prasad V.
dc.contributor.committeeMember Yu, Xingxing
dc.contributor.department Mathematics en_US
dc.date.accessioned 2010-06-10T15:10:25Z
dc.date.available 2010-06-10T15:10:25Z
dc.date.issued 2009-11-24 en_US
dc.description.abstract Tanenbaum, Trenk, and Fishburn introduced the concept of linear discrepancy in 2001, proposing it as a way to measure a partially ordered set's distance from being a linear order. In addition to proving a number of results about linear discrepancy, they posed eight challenges and questions for future work. This dissertation completely resolves one of those challenges and makes contributions on two others. This dissertation has three principal components: 3-discrepancy irreducible posets of width 3, degree bounds, and online algorithms for linear discrepancy. The first principal component of this dissertation provides a forbidden subposet characterization of the posets with linear discrepancy equal to 2 by completing the determination of the posets that are 3-irreducible with respect to linear discrepancy. The second principal component concerns degree bounds for linear discrepancy and weak discrepancy, a parameter similar to linear discrepancy. Specifically, if every point of a poset is incomparable to at most D other points of the poset, we prove three bounds: the linear discrepancy of an interval order is at most D, with equality if and only if it contains an antichain of size D; the linear discrepancy of a disconnected poset is at most the greatest integer less than or equal to (3D-1)/2; and the weak discrepancy of a poset is at most D. The third principal component of this dissertation incorporates another large area of research, that of online algorithms. We show that no online algorithm for linear discrepancy can be better than 3-competitive, even for the class of interval orders. We also give a 2-competitive online algorithm for linear discrepancy on semiorders and show that this algorithm is optimal. en_US
dc.description.degree Ph.D. en_US
dc.identifier.uri http://hdl.handle.net/1853/33810
dc.publisher Georgia Institute of Technology en_US
dc.subject Semiorders en_US
dc.subject Partially ordered sets en_US
dc.subject Linear discrepancy en_US
dc.subject Online algorithms en_US
dc.subject Interval orders en_US
dc.subject.lcsh Partially ordered sets
dc.subject.lcsh Irregularities of distribution (Number theory)
dc.title Some results on linear discrepancy for partially ordered sets en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Trotter, William T.
local.contributor.corporatename College of Sciences
local.contributor.corporatename School of Mathematics
relation.isAdvisorOfPublication dbf7b2c4-52f7-4eb0-9f92-ce4f7de2761b
relation.isOrgUnitOfPublication 85042be6-2d68-4e07-b384-e1f908fae48a
relation.isOrgUnitOfPublication 84e5d930-8c17-4e24-96cc-63f5ab63da69
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Keller_Mitchel_T_201005_phd.pdf
Size:
1.56 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations