{'fraction_non_alphanumeric': 0.009487666034155597, 'fraction_numerical': 0.0018975332068311196, 'mean_word_length': 4.557894736842106, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, '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}}
ON THE MINIMUM NUMBER OF DISTINCT EIGENVALUES FOR A SYMMETRIC MATRIX WHOSE GRAPH IS A GIVEN TREE

It is shown that for any tree T the minimum number of distinct eigenvalues of an Hermitian matrix whose graph is T (diagonal entries free) is at least the number of vertices in a longest path of T. This is another step toward the general problem of characterizing the possible multiplicities for a given graph. Related observations are made and the result facilitates a table of multiplicities for trees on fewer than 8 vertices.