On majorization for polynomials sharing a common interlacer
Aurelien Gribinski

TL;DR
This paper establishes necessary and sufficient conditions for majorization among real-rooted polynomials sharing an interlacer, introduces the concept of strong majorization, and explores their relationships using residue-based methods.
Contribution
It provides a complete characterization of majorization for polynomials with a common interlacer and introduces the new concept of strong majorization.
Findings
Characterization of majorization via residues and fraction decomposition.
Introduction of strong majorization and its relation to standard majorization.
Framework applicable to real-rooted polynomials sharing an interlacer.
Abstract
We give necessary and sufficient conditions for majorization of realrooted polynomials sharing a common interlacer by means of residues coming from fraction decomposition. We also introduce a motivated notion called strong majorization, and we show how it relates to standard majorization.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Polynomial and algebraic computation · graph theory and CDMA systems
