On the \(L_{2}\)-discrepancy (Q2381825): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.04.021 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999035582 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the discrepancy of combinatorial rectangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2784326 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ``Integer-making'' theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871774 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Six Standard Deviations Suffice / rank | |||
Normal rank |
Latest revision as of 15:47, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the \(L_{2}\)-discrepancy |
scientific article |
Statements
On the \(L_{2}\)-discrepancy (English)
0 references
19 September 2007
0 references
In this article, the following problem is considered. Let \(\mathcal{S}\) be a family of subsets of a finite set \(V\) and let \(\chi:V\rightarrow \{-1,1\}\) be a coloring of \(V\). For \(S_j\in\mathcal{S}\), let \(\chi(S_j):=\sum_{v\in S_j}\chi (v)\) and define the \(L_2\)-discrepancy of \(\mathcal{S}\) with respect to \(\chi\) as \[ \text{disc}_2(\mathcal{S},\chi):=\biggl(\frac{1}{| \mathcal{S} |}\sum_j |\chi (S_j)|^2\biggr)^{1/2}. \] Furthermore, the \(L_2\)-discrepancy of \(\mathcal{S}\) is defined by \[ \text{disc}_2 (\mathcal{S}):=\min_\chi \text{disc}_2 (\mathcal{S},\chi), \] where the minimum is extended over all colorings \(\chi\). The authors of this note discuss a relation of the \(L_2\)-discrepancy problem to the so called MAX-CUT problem and show two main results. Firstly, it is shown that the \(L_2\)-discrepancy problem is NP-complete. Moreover, the authors show that there exists a coloring \(\chi\) such that \[ \biggl(\frac{1}{| \mathcal{S} |}\sum_j |\chi (S_j)|^2\biggr)^{1/2}\leq\sqrt{| V|}. \]
0 references
Coloring
0 references
hypergraph
0 references
\(L_2\)-discrepancy
0 references
NP-completeness
0 references