On the discrepancy of combinatorial rectangles

DOI10.1002/RSA.10055MaRDI QIDQ4798164zbMATH OpenOpenAlexFDO

Authors Noga Alon, Benjamin Doerr, Tomasz Łuczak, Tomasz Schoen

Publication date 19 March 2003

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.10055

zbMATH Keywords

combinatorial rectanglesdiscrepancyprobabilistic method

Mathematics Subject Classification ID

Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• On combinatorial rectangles with minimum \(\infty \)-discrepancy
• scientific article; zbMATH DE number 472864
• On the Discrepancy for Cartesian Products
• Lower bounds for \(L_1\) discrepancy
• On lower bounds for the \(L_2\)-discrepancy

Cited in

(10)

• On the discrepancy for boxes and polytopes
• Random sampling and approximation of MAX-CSPs
• Quantum discrepancy: a non-commutative version of combinatorial discrepancy
• On the \(L_{2}\)-discrepancy
• Non-independent randomized rounding and coloring
• scientific article; zbMATH DE number 472864 (Why is no real title available?)
• scientific article; zbMATH DE number 1054784 (Why is no real title available?)
• On the Discrepancy for Cartesian Products
• Tighter bounds for the discrepancy of boxes and polytopes
• On combinatorial rectangles with minimum \(\infty \)-discrepancy

This page was built for publication: On the discrepancy of combinatorial rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798164)