scientific article; zbMATH DE number 863495
zbMATH Open0851.11043MaRDI QIDQ4871774FDOQ4871774
Authors: József Beck, Vera T. Sós
Publication date: 29 May 1996
Title of this publication is not available (Why is that?)
Recommendations
surveyuniform distributionpartitionboundsergodic theoryarithmetic progressionshypergraphsvector sumsRamsey's theoremdiscrepancy theorycombinatorial discrepancyhereditary discrepancyirregularities of distributionsdiagonal discrepancygeometric discrepanciesinhomogeneous discrepancymeasure theoretic discrepancySchmidt's lower bound
Partitions of sets (05A18) Irregularities of distribution, discrepancy (11K38) Hypergraphs (05C65) Ramsey theory (05D10) General theory of distribution modulo (1) (11K06) Research exposition (monographs, survey articles) pertaining to number theory (11-02)
Cited In (49)
- Vector balancing games with aging
- Vector Balancing Games with Aging
- On the discrepancy of circular sequences of reals
- Geometric discrepancy. An illustrated guide
- Unital designs with blocking sets
- Discrepancy of Sums of Arithmetic Progressions
- Discrepancy of Sums of two Arithmetic Progressions
- Discrepancy and signed domination in graphs and hypergraphs
- On the Computational Complexity of Linear Discrepancy
- Discrepancy principle for DSM. II
- The structure and number of global roundings of a graph
- Typical rounding problems
- The exponent of discrepancy is at least 1. 0669
- Reroute sequence planning in telecommunication networks and compact vector summation.
- Upper bounds in classical discrepancy theory
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Geometric discrepancy. An illustrated guide
- The determinant bound for discrepancy is almost tight
- Signed domination in regular graphs and set-systems
- Laplace eigenvalues of graphs---a survey
- Partial Colorings of Unimodular Hypergraphs
- Combinatorics and algorithms for low-discrepancy roundings of a real sequence
- A lower bound for the discrepancy of a random point set
- Preface
- Non-independent randomized rounding and coloring
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- On the \(L_{2}\)-discrepancy
- On combinatorial rectangles with minimum \(\infty \)-discrepancy
- Discrepancy theory and related algorithms
- Intersections of hypergraphs
- Discrepancy theory
- Discrepancy theory and its applications
- The chip-firing game
- A note on the discrepancy of matrices with bounded row and column sums
- Title not available (Why is that?)
- Theory of Disruption in GE
- Discrepancy of (centered) arithmetic progressions in \({\mathbb{Z}_p}\)
- Balanced partitions of vector sequences
- Title not available (Why is that?)
- A discrepancy problem: balancing infinite dimensional vectors
- Title not available (Why is that?)
- Results and problems old and new in discrepancy theory
- Discrepancy of centered arithmetic progressions in \(\mathbb{Z}_p\) (extended abstract)
- On the linear and hereditary discrepancies
- Computer-aided proof of Erdős discrepancy properties
- On the \(L_2\)-discrepancy for anchored boxes
- Recent progress on combinatorics and algorithms for low discrepancy roundings
- Some of Jiří Matoušek's contributions to combinatorial discrepancy theory
- Small sample uniformity in random number generation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871774)