{'fraction_non_alphanumeric': 0.0481203007518797, 'fraction_numerical': 0.0015037593984962407, 'mean_word_length': 4.946428571428571, '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 algorithm to factorize sparse bivariate polynomials over the rationals

Polynomial factorization is one of the central problems and also a successful story in computer algebra. In this poster, we give a summary of an algorithm, recently presented in the authors’ manuscript [5], that uses both symbolic and numeric methods to exactly compute the irreducible factorization in Z[x, y], and therefore in Q[x, y], of any bivariate polynomial satisfying Hypothesis. On f ∈ Z[x, y] and its initial factors, we assume that (i) f is squarefree, non-constant and monic in x; (ii) f has no univariate factors; (iii) the initial factors of f are mutually coprime.