A note on a paper by Hashemi and Kapur
Symbolic Computation
2025-10-08 v1
Abstract
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.
Cite
@article{arxiv.2510.05103,
title = {A note on a paper by Hashemi and Kapur},
author = {Anna Nymann Heisel and Niels Lauritzen},
journal= {arXiv preprint arXiv:2510.05103},
year = {2025}
}
Comments
Comment on https://doi.org/10.1016/j.jsc.2024.102391