{'fraction_non_alphanumeric': 0.02337228714524207, 'fraction_numerical': 0.001669449081803005, 'mean_word_length': 5.315789473684211, '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}}
An efficient squarefree decomposition algorithm

The concept of polynomial squarefree decomposition is an important one in algebraic computation. The squarefree decomposition process has many uses in computer symbolic computation. A recent survey by D. Yun [3] describes many useful algorithms for this purpose. All of these methods depend on computing the greatest common divisior (gcd) of the polynomial to be decomposed and its first derivative (with respect to some variable). In the multivariate case, this gcd computation is non-trivial and dominates the cost for the squarefree decomposition.