Add to ORKGDiscrepancy theory seeks to understand how well a continuous object can be approximated by a discrete one, with respect to some measure of uniformity. For instance, a celebrated result due to Spencer says that given any set family S1,..., Sn ⊂ [n], it is possible to colour the elements of [n] Red and Blue in a manner that
The main focus of this thesis work is computational aspects of discrepancy theory. Discrepancy theor...
Spencer\u27s theorem asserts that, for any family of n subsets of ground set of size n, the elements...
Given a set system (V, S), V = {1,..., n} and S = {S1,...,Sm}, the minimum discrepancy problem is to...
Minimizing the discrepancy of a set system is a fundamental problem in combinatorics. One of the cor...
This chapter describes some recent results in combinatorial discrepancy theory motivated by designin...
Discrepancy theory concerns the problem of replacing a continuous object with a discrete sampling. D...
AbstractWe give a combinatorial form of the Kadison–Singer problem, a famous problem in C∗-algebra. ...
The discrepancy of a set-system is the minimum number d for which the vertices can be 2-coloured red...
We derandomize a recent algorithmic approach due to Bansal [2] to efficiently compute low discrepanc...
AbstractWhile discrepancy theory is normally only studied in the context of 2-colorings, we explore ...
Let XR be a set system on an npoint set X We investigate colorings X f g such that the sum of ...
The Komlós conjecture in discrepancy theory asks for a ±1-coloring, for any given unit vectors, ac...
The main focus of this thesis work is computational aspects of discrepancy theory. Discrepancy theor...
Spencer\u27s theorem asserts that, for any family of n subsets of ground set of size n, the elements...
Given a set system (V, S), V = {1,..., n} and S = {S1,...,Sm}, the minimum discrepancy problem is to...
Minimizing the discrepancy of a set system is a fundamental problem in combinatorics. One of the cor...
This chapter describes some recent results in combinatorial discrepancy theory motivated by designin...
Discrepancy theory concerns the problem of replacing a continuous object with a discrete sampling. D...
AbstractWe give a combinatorial form of the Kadison–Singer problem, a famous problem in C∗-algebra. ...
The discrepancy of a set-system is the minimum number d for which the vertices can be 2-coloured red...
We derandomize a recent algorithmic approach due to Bansal [2] to efficiently compute low discrepanc...
AbstractWhile discrepancy theory is normally only studied in the context of 2-colorings, we explore ...
Let XR be a set system on an npoint set X We investigate colorings X f g such that the sum of ...
The Komlós conjecture in discrepancy theory asks for a ±1-coloring, for any given unit vectors, ac...
The main focus of this thesis work is computational aspects of discrepancy theory. Discrepancy theor...
Spencer\u27s theorem asserts that, for any family of n subsets of ground set of size n, the elements...
Given a set system (V, S), V = {1,..., n} and S = {S1,...,Sm}, the minimum discrepancy problem is to...