Linear discrepancy of basic totally unimodular matrices
The electronic journal of combinatorics, Tome 7 (2000)
We show that the linear discrepancy of a basic totally unimodular matrix $A \in R^{m \times n}$ is at most $1- {1\over {n+1}}$. This extends a result of Peng and Yan.
DOI :
10.37236/1526
Classification :
15B36, 05B20, 11K38
Mots-clés : totally unimodular matrices, 0-1-matrices, linear discrepancy, determinant
Mots-clés : totally unimodular matrices, 0-1-matrices, linear discrepancy, determinant
@article{10_37236_1526,
author = {Benjamin Doerr},
title = {Linear discrepancy of basic totally unimodular matrices},
journal = {The electronic journal of combinatorics},
year = {2000},
volume = {7},
doi = {10.37236/1526},
zbl = {0996.15012},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1526/}
}
Benjamin Doerr. Linear discrepancy of basic totally unimodular matrices. The electronic journal of combinatorics, Tome 7 (2000). doi: 10.37236/1526
Cité par Sources :