Say $\{a_1,a_2,..,a_n\}$ and $\{b_1,b_2,...,b_n\}$ be the real roots of two monic polynomials of degree $n$ which have a common interlacing. (say I have arranged the roots in increasing order)
Can one estimate for how large a positive integer $k$ is it possible that, $\sum_i a_i ^k = \sum_i b_i^k$ might hold?
And given a positive integer say $p$ is there a good lower bound on the term, $\sum_i (a_i^p - b_i^p)$ ?
DEFINITION :
These two polynomials will be said to have a "common interlacing" if there exits numbers $\{ c_1,..,c_{n-1}\}$ such that $c_i \in [a_i ,a_{i+1}] \cap [b_i, b_{i+1}]$. (this is basically saying that it is possible to construct another polynomial whose every root is always simultaneously between two consecutive roots of both the polynomials)
A simple example of two polynomials which are not of "common interlacing" is to consider $(x-1)(x-3)$ and $(x-4)(x-5)$.