Ideal basis and primary decompositions: case of two variables (Q1821556): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On constructing bases for ideals in polynomial rings over the integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Description de Hilb sup(n) C{X,Y} / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2902935 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3208084 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3957939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3714165 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resolution of singularities of an algebraic variety over a field of characteristic zero. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Résolution des systèmes d'équations algébriques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3345782 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3325833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructions in Algebra / rank | |||
Normal rank |
Latest revision as of 19:28, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Ideal basis and primary decompositions: case of two variables |
scientific article |
Statements
Ideal basis and primary decompositions: case of two variables (English)
0 references
1985
0 references
Gröbner bases provide a universal technique for computer-algebraic treatment of algebraic and geometric problems. However, the question of structural complexity of Gröbner bases and that of the computational complexity of the relevant algorithms remain as yet practically open. The present paper contains a complete and constructive description of Gröbner bases for the class of two-variable polynomials over a field and that of univariate polynomials over a Euclidean ring. This description gives rise to a simple algorithm for computing primary decompositions. A natural factorization is also found for the resultant of two univariate polynomials.
0 references
Gröbner bases
0 references
structural complexity
0 references
computational complexity
0 references
two- variable polynomials over a field
0 references
univariate polynomials over a Euclidean ring
0 references
algorithm for computing primary decompositions
0 references
factorization
0 references
0 references