{'fraction_non_alphanumeric': 0.02406417112299465, 'fraction_numerical': 0.00267379679144385, 'mean_word_length': 4.507352941176471, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Doubly Stochastic Single Eigenvalue Problem: A Computational Approach

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.