Abbott, J. and Kreuzer, Martum and Robbiano, L. (2005) Computing zero-dimensional schemes. JOURNAL OF SYMBOLIC COMPUTATION, 39 (1). pp. 31-49. ISSN 0747-7171,
Full text not available from this repository. (Request a copy)Abstract
This paper is a natural continuation of Abbott et al. [Abbott, J., Bigatti, A., Kreuzer, M., Robbiano, L., 2000. Computing ideals of points. J. Symbolic Comput. 30, 341-356] further generalizing the Buchberger-Moller algorithm to zero-dimensional schemes in both affine and projective spaces. We also introduce a new, general way of viewing the problems which can be solved by the algorithm: an approach which looks to be readily applicable in several areas. Implementation issues are also addressed, especially for computations over Q where a trace-lifting paradigm is employed. We give a complexity analysis of the new algorithm for fat points in affine space over Q. Tables of timings show the new algorithm to be efficient in practice. (C) 2004 Elsevier Ltd. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | GROBNER BASES; IDEALS; POINTS; Grobner basis algorithm; fat points; zero-dimensional schemes |
| Subjects: | 500 Science > 510 Mathematics |
| Divisions: | Mathematics |
| Depositing User: | Dr. Gernot Deinzer |
| Date Deposited: | 07 Jun 2021 12:46 |
| Last Modified: | 07 Jun 2021 12:46 |
| URI: | https://pred.uni-regensburg.de/id/eprint/36749 |
Actions (login required)
 |
View Item |
