Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.05103 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915535530229760 |
|---|---|
| author | Heisel, Anna Nymann Lauritzen, Niels |
| author_facet | Heisel, Anna Nymann Lauritzen, Niels |
| contents | Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_05103 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A note on a paper by Hashemi and Kapur Heisel, Anna Nymann Lauritzen, Niels Symbolic Computation Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm. |
| title | A note on a paper by Hashemi and Kapur |
| topic | Symbolic Computation |
| url | https://arxiv.org/abs/2510.05103 |