{'fraction_non_alphanumeric': 0.015133876600698487, 'fraction_numerical': 0.0011641443538998836, 'mean_word_length': 4.341614906832298, '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}}
Induced good gradings of structural matrix rings

Abstract Our approach to structural matrix rings defines them over preordered directed graphs. A grading of a structural matrix ring is called a good grading if its standard unit matrices are homogeneous. For a group G, a G-grading set is a set of arrows with the property that any assignment of these arrows to elements of G uniquely determines an induced good grading. One of our main results is that a G-grading set exists for any transitive directed graph if G is a group of prime order. This extends a result of Kelarev. However, an example of Molli Jones shows there are directed graphs which do not have G-grading sets for any cyclic group G of even order greater than 2. Finally, we count the number of nonequivalent elementary gradings by a finite group of a full matrix ring over an arbitrary field.