An algorithm computes leading monomials of minimal Groebner bases for generic homogeneous polynomial sequences by degree-by-degree construction using conjectured weakly reverse lexicographic ideals and closed-form Hilbert series comparisons.
PhD thesis, Universität Innsbruck (1965)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Algorithm for Computing the Leading Monomials of a Minimal Groebner Basis of Generic Sequences
An algorithm computes leading monomials of minimal Groebner bases for generic homogeneous polynomial sequences by degree-by-degree construction using conjectured weakly reverse lexicographic ideals and closed-form Hilbert series comparisons.