Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-07T14:37:22.682Z Has data issue: false hasContentIssue false

Linear and Hereditary Discrepancy

Published online by Cambridge University Press:  06 November 2000

BENJAMIN DOERR
Affiliation:
Mathematisches Seminar, Christian-Albrechts-Universität zu Kiel, Ludewig-Meyn-Str. 4, 24098 Kiel, Germany (e-mail: bed@numerik.uni-kiel.de)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let A be an m × n matrix and q := [lfloor]log2(m)[rfloor]+1. In this article we improve the well-known bound lindisc(A) [les ] 2 herdisc(A) and show that

formula here

As with the previous proofs relating to this problem, ours is constructive. We will give an on-line algorithm and analyse it using game theory.

Information

Type
Research Article
Copyright
2000 Cambridge University Press