Deterministic genericity for polynomial ideals (Q1680155)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6811339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic genericity for polynomial ideals |
scientific article; zbMATH DE number 6811339 |
Statements
Deterministic genericity for polynomial ideals (English)
0 references
22 November 2017
0 references
The authors deal, mainly from the algorithmic point of view, with the notion of genericity in the frame of commutative algebra, and more precisely in relation to polynomial ideals. More specifically, the paper emphasizes on generic positions related to Gröbner bases. For this purpose, the authors define several stability notions using combinatorial descriptions. Algorithms for obtaining generic positions are provided.
0 references
polynomial ideals
0 references
deterministic algorithms
0 references
Gröbner bases
0 references
Pommaret bases
0 references
generic positions
0 references
generic initial ideals
0 references
strongly stable ideals
0 references
stable ideals
0 references
quasi stable ideals
0 references
componentwise stability
0 references
\(\beta\)-maximal position
0 references
Noether position
0 references
0 references
0.7608487010002136
0 references
0.7537248730659485
0 references
0.7504738569259644
0 references
0.7504738569259644
0 references
0.7460232973098755
0 references
