2009/09/29 by Junaid Khan, Khan, Junaid Alam
Computer Science · Mathematics · #13J10 #13P10 #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Formal Methods in Verification #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.0909.5329
openalex publication_date 2009/09/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The theory of "subalgebra basis" analogous to standard basis (the generalization of Gröbner bases to monomial ordering which are not necessarily well ordering \citeGP1.) for ideals in polynomial rings over a field is developed. We call these bases "SASBI Basis" for "Subalgebra Analogue to Standard Basis for Ideals". The case of global orderings, here they are called "SAGBI Basis" for "Subalgebra Analogue to Gröbner Basis for Ideals", is treated in \citeRS1. Sasbi bases may be infinite. In this paper we consider subalgebras admitting a finite Sasbi basis and give algorithms to compute them. The algorithms have been implemented as a library for the computer algebra system SINGULAR \citeGPS1.