Choosing roots of polynomials smoothly (Q1264286)

The authors study the problem whether for a smooth curve of polynomials one can choose the roots in a smooth fashion. They suggest an algorithm which sometimes gives rise to a solution. Typical results are the following. Assume that all the roots are real. Then they can always be chosen differentiable, but not always \(C^1\) in degree \(\geq 3\). In degree 2 it is always possible to choose the roots being twice differentiable, but not \(C^2\) in general.