Ask a Question

Prefer a chat interface with context about you and your work?

Efficient algorithms for discrepancy minimization in convex sets

Efficient algorithms for discrepancy minimization in convex sets

A result of Spencer states that every collection of n sets over a universe of size n has a coloring of the ground set with of discrepancy . A geometric generalization of this result was given by Gluskin (see also Giannopoulos) who showed that every symmetric convex body with Gaussian …