The Independence of Characters on Nonabelian Groups
This document has been relocated to http://scholarsmine.mst.edu/math_stat_facwork/680
There were 4 downloads as of 28 Jun 2016.
We show that there are characters of compact, connected, nonabelian groups that approximate random choices of signs. The work was motivated by Kronecker's theorem on the independence of exponential functions and has applications to thin sets.