Abstract | ||
---|---|---|
We discuss the problem of determining reduction numbers of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computations in a polynomial ring with (n - dimI) dimI parameters and n - dimI variables. The second one computes via a Grobner system the set of all reduction numbers of the ideal I and thus in particular also its big reduction number. However, it requires computations in a ring with n dimI parameters and n variables. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-319-10515-4_14 | COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, CASC 2014 |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Polynomial,Polynomial ring,Parametric statistics,Mathematics,Computation | Conference | 8660 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Amir Hashemi | 1 | 54 | 13.92 |
Michael Schweinfurter | 2 | 4 | 1.14 |
Werner M. Seiler | 3 | 79 | 17.45 |