A test for monomial containment (Q512370): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The monomial containment problem is to decide if an ideal in a polynomial ring contains monomials. This problem can be solved using Gröbner bases by computing a colon ideal. The present paper avoids Gröbner bases and specializes the method of triangular sets for this purpose.
Property / review text: The monomial containment problem is to decide if an ideal in a polynomial ring contains monomials. This problem can be solved using Gröbner bases by computing a colon ideal. The present paper avoids Gröbner bases and specializes the method of triangular sets for this purpose. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Thomas Kahle / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 13P05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 13P10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 13P15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 14Q99 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6688747 / rank
 
Normal rank
Property / zbMATH Keywords
 
monomial containment
Property / zbMATH Keywords: monomial containment / rank
 
Normal rank
Property / zbMATH Keywords
 
triangular set
Property / zbMATH Keywords: triangular set / rank
 
Normal rank

Revision as of 04:08, 1 July 2023

scientific article
Language Label Description Also known as
English
A test for monomial containment
scientific article

    Statements

    A test for monomial containment (English)
    0 references
    0 references
    0 references
    24 February 2017
    0 references
    The monomial containment problem is to decide if an ideal in a polynomial ring contains monomials. This problem can be solved using Gröbner bases by computing a colon ideal. The present paper avoids Gröbner bases and specializes the method of triangular sets for this purpose.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    monomial containment
    0 references
    triangular set
    0 references