Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.10246 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913108574863360 |
|---|---|
| author | Sakata, Kosuke Takagi, Tsuyoshi |
| author_facet | Sakata, Kosuke Takagi, Tsuyoshi |
| contents | We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties conjectured to hold for generic sequences-specifically, that their leading monomial ideals are weakly reverse lexicographic and that their Hilbert series follow a known closed-form expression. The algorithm incrementally constructs the set of leading monomials degree by degree by comparing Hilbert functions of monomial ideals with the expected Hilbert series of the input ideal. To enhance computational efficiency, we introduce several optimization techniques that progressively narrow the search space and reduce the number of divisibility checks required at each step. We also refine the loop termination condition using degree bounds, thereby avoiding unnecessary recomputation of Hilbert series. Experimental results confirm that the proposed method substantially reduces both computation time and memory usage compared to conventional Groebner basis computations for computing the leading monomials of a minimal Groebner basis of generic sequences. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_10246 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Algorithm for Computing the Leading Monomials of a Minimal Groebner Basis of Generic Sequences Sakata, Kosuke Takagi, Tsuyoshi Symbolic Computation We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties conjectured to hold for generic sequences-specifically, that their leading monomial ideals are weakly reverse lexicographic and that their Hilbert series follow a known closed-form expression. The algorithm incrementally constructs the set of leading monomials degree by degree by comparing Hilbert functions of monomial ideals with the expected Hilbert series of the input ideal. To enhance computational efficiency, we introduce several optimization techniques that progressively narrow the search space and reduce the number of divisibility checks required at each step. We also refine the loop termination condition using degree bounds, thereby avoiding unnecessary recomputation of Hilbert series. Experimental results confirm that the proposed method substantially reduces both computation time and memory usage compared to conventional Groebner basis computations for computing the leading monomials of a minimal Groebner basis of generic sequences. |
| title | An Algorithm for Computing the Leading Monomials of a Minimal Groebner Basis of Generic Sequences |
| topic | Symbolic Computation |
| url | https://arxiv.org/abs/2505.10246 |