Computing dimension and independent sets for polynomial ideals (Q1116332)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing dimension and independent sets for polynomial ideals |
scientific article; zbMATH DE number 4088918
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing dimension and independent sets for polynomial ideals |
scientific article; zbMATH DE number 4088918 |
Statements
Computing dimension and independent sets for polynomial ideals (English)
0 references
1988
0 references
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.
0 references
polynomial ideal
0 references
complexity
0 references
Gröbner bases
0 references
correctness
0 references
0 references
0 references
0.9130734
0 references
0.90877235
0 references
0.90529126
0 references
0.9048895
0 references
0.9039218
0 references
0.90286463
0 references
