Name
Abstract | ||
|---|---|---|
We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent algebraic characterisations are provided. It is shown that in characteristic zero the corresponding generic positions can be obtained with a simple deterministic algorithm. In positive characteristic, only adapted stable positions are reachable except for quasi-stability which is obtainable in any characteristic. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jsc.2017.03.008 | Journal of Symbolic Computation |
Keywords | DocType | Volume |
Polynomial ideals,Deterministic algorithms,Gröbner bases,Pommaret bases,Generic positions,Generic initial ideals,Strongly stable ideals,Stable ideals,Quasi stable ideals,Componentwise stability,β-maximal position,Noether position | Journal | 86 |
Issue | ISSN | Citations |
C | 0747-7171 | 1 |
PageRank | References | Authors |
0.36 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir Hashemi | 1 | 54 | 13.92 |
| Michael Schweinfurter | 2 | 4 | 1.14 |
| Werner M. Seiler | 3 | 79 | 17.45 |