|
Deterministic Genericity for Polynomial Ideals
|
| Co-author(s): Amir Hashemi and Michael Schweinfurter |
| Reference: Journal of Symbolic Computation, 86 (2018) 20-50 |
| Description: We study a large number of generic positions for polynomial ideals, in
particular many related to different variants of the combinatorial notion
of stability. The main result is a deterministic algorithm to transform a
given ideal into one of the generic positions related to stability. Other
results are a combinatorial description of Noether position, a novel
criterion for componentwise quasi-stability and a large collection of
examples demonstrating that all considered positions are indeed distinct. |
PDF File:  (481 kB)
|
|
Home,
Last update:
Sun Nov 26 17:38:34 2017
|