On the discrepancy of 3 permutations

DOI10.1002/RSA.3240010208MaRDI QIDQ3977077zbMATH OpenOpenAlexFDO

Authors Géza Bohus

Publication date 25 June 1992

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

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

zbMATH Keywords

bounded discrepancy

Mathematics Subject Classification ID

Hypergraphs (05C65) Total orders (06A05)

Recommendations

• A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy
• Multi-color discrepancies
• Multicolour Discrepancies
• Scrambling permutations and entropy of hypergraphs
• A note on the Beck-Fiala theorem

Cites work

• Irregularities of distribution. I

Cited in

(9)

• Good permutations for extreme discrepancy
• Computing a small agreeable set of indivisible items
• Recent progress on combinatorics and algorithms for low discrepancy roundings
• Constructive Discrepancy Minimization for Convex Sets
• Scrambling permutations and entropy of hypergraphs
• A simplified disproof of Beck’s three permutations conjecture and an application to root-mean-squared discrepancy
• Five discordant permutations
• Matrix approximation and Tusnády's problem
• The three-permutations problem

This page was built for publication: On the discrepancy of 3 permutations

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