{'fraction_non_alphanumeric': 0.02058319039451115, 'fraction_numerical': 0.0017152658662092624, 'mean_word_length': 5.1421052631578945, '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}}
Numerical Computation of Grobner Bases for Zero-dimensional Polynomial Ideals

It is well known that in the computation of Groobner bases an arbitrarily small perturbation in the coefficients of polynomials may lead to a completely different staircase even if the roots of the polynomials change continuously. This phenomenon is called pseudo singularity in this paper. We show how such phenomenon may be detected and even “repaired” by adding a new variable and a binomial relation each time. To investigate how often likely pseudo singularities may happen in numerical computation of Grobner bases, two algorithms e-Buchberger and e-MatrixF5 are provided. Our main algorithm, named VSGBn corresponding to Buchberger’s algorithm, can compute “more stable” Grobner bases of equivalent ideals (with the same set of zeros) and thus are suitable for the computation of Grobner bases for ideals generated by polynomials with floating-point coefficients. The main theorem of this paper is that any monomial basis (containing 1) of the quotient ring can be found out using VSGB strategy. Experiments show that the algorithms can be used to solve some non-trivial problems.