{'fraction_non_alphanumeric': 0.016417910447761194, 'fraction_numerical': 0.0014925373134328358, 'mean_word_length': 5.917525773195877, '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}}
Direct sum decomposability of polynomials and factorization of associated forms

We prove two criteria for direct sum decomposability of homogeneous polynomials. For a homogeneous polynomial with a non‐zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of the Macaulay inverse system of its Milnor algebra. This leads to an if‐and‐only‐if criterion for direct sum decomposability of such a polynomial, and to an algorithm for computing direct sum decompositions over any field, either of characteristic 0 or of sufficiently large positive characteristic, for which polynomial factorization algorithms exist.