Tight bounds for positive discrepancy via eigenvalues

Oliver Janzer, István Tomon, Fredy Yip

Given an $n\times n$ symmetric matrix $M$ with largest eigenvalue ${\lambda }_1\ge 0$, it is easy to show that the solution of the optimisation problem ${\max }_{v\in [-1,1{]}^n}{v}^{T}Mv$ is at mo…