On the zeros of convex combinations of polynomials
From MaRDI portal
(Redirected from Publication:754326)
Cited in
(14)- Sequences of polynomials whose zeros lie on fixed lemniscates
- Root and critical point behaviors of certain sums of polynomials
- On the largest eigenvalue of a mixed graph with partial orientation
- Interlacing families. III: Sharper restricted invertibility estimates
- Four deviations suffice for rank 1 matrices
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Interlacing families. IV: Bipartite Ramanujan graphs of all sizes
- Instability of \(k\)-cluster solutions in a cell cycle population model when \(k\) is prime
- On the maximum and minimum modulus of polynomials on circles
- The s-Eulerian polynomials have only real roots
- Universality of stable multi-cluster periodic solutions in a population model of the cell cycle with negative feedback
- Sums of two polynomials with each having real zeros symmetric with the other
- Interlacing polynomial method for matrix approximation via generalized column and row selection
This page was built for publication: On the zeros of convex combinations of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754326)