A note on the discrepancy of matrices with bounded row and column sums
From MaRDI portal
(Redirected from Publication:488272)
Abstract: A folklore result uses the Lovasz local lemma to analyze the discrepancy of hypergraphs with bounded degree and edge size. We generalize this result to the context of real matrices with bounded row and column sums.
Recommendations
Cites work
- ``Integer-making theorems
- A constructive proof of the general Lovász local lemma
- Graph colouring and the probabilistic method
- scientific article; zbMATH DE number 863495 (Why is no real title available?)
- scientific article; zbMATH DE number 6472647 (Why is no real title available?)
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Six Standard Deviations Suffice
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(4)- On the upper bounds of the minimum number of rows of disjunct matrices
- Short proofs of the Gale \& Ryser and Ford \& Fulkerson characterizations of the row and column sum vectors of (0, 1)-matrices
- On the discrepancy of random matrices with many columns
- \(\ell_1\)-sparsity approximation bounds for packing integer programs
This page was built for publication: A note on the discrepancy of matrices with bounded row and column sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488272)