A note on a paper by Hashemi and Kapur

2025/08/18 by Anna Nymann Heisel, Heisel, Anna Nymann, Niels Lauritzen +1
Mathematics · #Advanced Banach Space Theory #Approximation Theory and Sequence Spaces #FOS: Computer and information sciences #Mathematical Dynamics and Fractals #Symbolic Computation (cs.SC)

paper · pdf · doi:10.48550/arxiv.2510.05103

openalex publication_date 2025/08/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• An efficient reduction strategy for signature-based algorithms to compute Groebner basis
• Simple signature-based Groebner basis algorithm
• Involutive Algorithms for Computing Groebner Bases
• An Algorithm for Computing the Leading Monomials of a Minimal Groebner Basis of Generic Sequences
• Signature-based algorithms to compute Groebner bases