Mathematical Colloquium 
Root Separation Bound 

By  Hoon Hong 
From  North Carolina State University 
When  Monday, November 13, 2017 4:00 pm 
Where  Weber 237 
Abstract  Let f be a squarefree polynomial. The root separation of f is the minimum of the pairwise distance between the complex roots of f. Finding a lower bound on the root separation is a fundamental problem, arising in numerous disciplines. Due to its importance, there has been extensive research on this problem, resulting in various bounds. In this talk, we present another bound, which is "nicer" than the previous bounds in that

Further Information 
Dan Bates 