Abstract: Given the current knowledge of complex representations of finite (quasi) simple groups, obtaining good upper bounds for their characters values still remains a difficult problem, a satisfactory solution of which would have significant implications in a number of applications. We will report on recent results that produce such character bounds, and discuss some such applications, including Thompson's conjecture G=C^2.
