Computing dimension and independent sets for polynomial ideals (Q1116332)

This paper presents an algorithm that computes the dimension and maximal independent sets of an ideal I in a polynomial ring. For this the author employs the novel notion of strong independence modulo a polynomial ideal I and relates strong independence with Gröbner bases first introduced by Buchberger (1965). In the paper, the obtained algorithm is tested for a number of examples, and is coded in the ALDES/SAC-2 system of Collins and Loos (1980). The correctness and an overview of the performance of the algorithm are also presented.