Reduced Groebner Bases With Double Exponential Cardinality
Combinatorics
2026-01-22 v3 Computational Complexity
Abstract
In this article, we investigate the cardinality of Groebner bases under various monomial orderings. We identify a family of polynomials F and a criterion such that the reduced Groebner basis of F is double exponential in cardinality with respect to any monomial ordering which satisfies this criterion. We also show that the said criterion is satisfied by orderings such as the lexicographic, degree lexicographic and weighted orderings.
Keywords
Cite
@article{arxiv.2411.17602,
title = {Reduced Groebner Bases With Double Exponential Cardinality},
author = {Archana S Morye and Sreenanda S B and Prakash Saivasan},
journal= {arXiv preprint arXiv:2411.17602},
year = {2026}
}
Comments
20 pages,3 figures