Abstract
The problem of determining DSn, the complex numbers that occur as an eigenvalue of an n-by-n doubly stochastic matrix, has been a target of study for some time. The Perfect-Mirsky region, PMn, is contained in DSn and is known to be exactly DSn for but strictly contained within DSn for n = 5. Here, we present a Boundary Conjecture that asserts that the boundary of DSn is achieved by eigenvalues of convex combinations of pairs of (or single) permutation matrices. We present a method to efficiently compute a portion of DSn and obtain computational results that support the Boundary Conjecture. We also give evidence that DSn is equal to PMn for certain n > 5.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
